Stem euclidean$ (all stems)

57 papers:

STOC-2015-BourgainDN #formal method #reduction #towards

Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space (JB, SD, JN), pp. 499–508.

ICML-2015-HuangWSLC #classification #image #learning #metric #set #symmetry

Log-Euclidean Metric Learning on Symmetric Positive Definite Manifold with Application to Image Set Classification (ZH, RW, SS, XL, XC), pp. 720–729.

VLDB-2015-SunWQZL14 #approximate #named #nearest neighbour #query

SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index (YS, WW, JQ, YZ, XL), pp. 1–12.

ICPR-2014-BlondelFU #multi #scalability

Large-Scale Multiclass Support Vector Machine Training via Euclidean Projection onto the Simplex (MB, AF, NU), pp. 1289–1294.

ICPR-2014-LinnerS #alias #anti #distance #graph #implementation

A Graph-Based Implementation of the Anti-aliased Euclidean Distance Transform (EL, RS), pp. 1025–1030.

ICPR-2014-Zhao

Euclidean Structure from Conic Feature Correspondences (ZZ), pp. 4010–4014.

RecSys-2014-BachrachFGKKNP #recommendation #using

Speeding up the Xbox recommender system using a euclidean transformation for inner-product spaces (YB, YF, RGB, LK, NK, NN, UP), pp. 257–264.

STOC-2013-ElkinS

Optimal euclidean spanners: really short, thin and lanky (ME, SS), pp. 645–654.

STOC-2013-Har-PeledR #algorithm #distance #linear #problem

Net and prune: a linear time algorithm for euclidean distance problems (SHP, BAR), pp. 605–614.

ICML-2012-YuSL12a #performance

Efficient Euclidean Projections onto the Intersection of Norm Balls (AWY, HS, FFL), p. 203.

ICPR-2012-LiW #encoding #matrix #recognition #using

Iris recognition using ordinal encoding of Log-Euclidean covariance matrices (PL, GW), pp. 2420–2423.

ICEIS-DISI-2010-Duin #pattern matching #pattern recognition #problem #recognition

Pattern Recognition as a Human Centered non-Euclidean Problem (RPWD), p. 5.

ICEIS-J-2010-Duin10a #pattern matching #pattern recognition #problem #recognition

Non-Euclidean Problems in Pattern Recognition Related to Human Expert Knowledge (RPWD), pp. 15–28.

ICPR-2010-Coeurjolly #approximate #performance

Fast and Accurate Approximation of the Euclidean Opening Function in Arbitrary Dimension (DC), pp. 229–232.

ICPR-2010-XuHW #similarity #using

Rectifying Non-Euclidean Similarity Data Using Ricci Flow Embedding (WX, ERH, RCW), pp. 3324–3327.

KDD-2010-MarchRG #algorithm #analysis #performance

Fast euclidean minimum spanning tree: algorithm, analysis, and applications (WBM, PR, AGG), pp. 603–612.

KR-2010-KontchakovPZ #logic

Interpreting Topological Logics over Euclidean Spaces (RK, IPH, MZ).

RecSys-2010-KhoshneshinS #collaboration

Collaborative filtering via euclidean embedding (MK, WNS), pp. 87–94.

CSL-2010-NenovP #logic #on the

On the Computability of Region-Based Euclidean Logics (YN, IPH), pp. 439–453.

ICML-2009-LiuY #linear #performance

Efficient Euclidean projections in linear time (JL, JY), pp. 657–664.

ICPR-2008-Bouchaffra #markov #modelling

Embedding HMM’s-based models in a Euclidean space: The topological hidden Markov models (DB), pp. 1–4.

ICPR-2008-FusielloI

Quasi-Euclidean uncalibrated epipolar rectification (AF, LI), pp. 1–4.

ICPR-2008-GuZ #metric #similarity

A similarity measure under Log-Euclidean metric for stereo matching (QG, JZ), pp. 1–4.

ICPR-2008-LladoBA #modelling

Recovering Euclidean deformable models from stereo-motion (XL, ADB, LdA), pp. 1–4.

ICPR-2008-Nordberg #3d #optimisation #performance

Efficient triangulation based on 3D Euclidean optimization (KN), pp. 1–4.

ICML-2006-CaytonD #robust

Robust Euclidean embedding (LC, SD), pp. 169–176.

ICPR-v1-2006-LladoBA #parametricity #re-engineering #using

Euclidean Reconstruction of Deformable Structure Using a Perspective Camera with Varying Intrinsic Parameters (XL, ADB, LdA), pp. 139–142.

ICPR-v2-2006-ChenWSCG #distance #image

Isomap Based on the Image Euclidean Distance (JC, RW, SS, XC, WG), pp. 1110–1113.

ICPR-v2-2006-ZhangQSW #assessment #image #quality

Euclidean Quality Assessment for Binary Images (CZ, ZQ, DS, JW), pp. 300–303.

STOC-2005-AroraLN

Euclidean distortion and the sparsest cut (SA, JRL, AN), pp. 553–562.

ICALP-2005-ElbassioniFMS #algorithm #approximate

Approximation Algorithms for Euclidean Group TSP (KME, AVF, NHM, RS), pp. 1115–1126.

KDD-2005-GuhaH #data type #fault

Wavelet synopsis for data streams: minimizing non-euclidean error (SG, BH), pp. 88–97.

ICPR-v1-2004-SirisathitkulAU #distance #image #performance #using

Fast Color Image Quantization using Squared Euclidean Distance of Adjacent Color Points along the Highest Color Variance Axis (YS, SA, BU), pp. 656–659.

ICPR-v2-2004-Tweed #formal method

Estimating Rigid Motions via the Conformal Model of Euclidean Space (DT), pp. 171–174.

ICPR-v3-2004-SchoutenB #distance #performance

Fast Exact Euclidean Distance (FEED) Transformation (TES, ELvdB), pp. 594–597.

SAC-2004-QianSGP #distance #nearest neighbour #query #similarity

Similarity between Euclidean and cosine angle distance for nearest neighbor queries (GQ, SS, YG, SP), pp. 1232–1237.

ICALP-2003-Jagerskupper #algorithm #analysis

Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces (JJ), pp. 1068–1079.

ICML-2003-Zhang #kernel #learning #metric #multi #representation #scalability #towards

Learning Metrics via Discriminant Kernels and Multidimensional Scaling: Toward Expected Euclidean Representation (ZZ), pp. 872–879.

STOC-2002-LinialMN

Girth and euclidean distortion (NL, AM, AN), pp. 705–711.

ICALP-2002-CzumajLZ #approximate #design #network #polynomial #problem

Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem (AC, AL, HZ), pp. 973–984.

ICPR-v3-2002-MekadaT #distance #using

Anchor Point Thinning Using a Skeleton Based on the Euclidean Distance Transformation (YM, JiT), pp. 923–926.

CIKM-2001-KimAY #effectiveness #metric #nearest neighbour

Effective Nearest Neighbor Indexing with the Euclidean Metric (SWK, CCA, PSY), pp. 9–16.

LICS-2001-EscardoS

A Universal Characterization of the Closed Euclidean Interval (MHE, AKS), pp. 115–125.

ICALP-2000-AkhaviV #algorithm

Average Bit-Complexity of Euclidean Algorithms (AA, BV), pp. 373–387.

ICALP-2000-CzumajL #approximate #multi #performance #problem

Fast Approximation Schemes for Euclidean Multi-connectivity Problems (AC, AL), pp. 856–868.

STOC-1999-Gupta #metric

Embedding Tree Metrics Into Low Dimensional Euclidean Spaces (AG), pp. 694–700.

SAC-1999-Rivera-Gallego #algorithm #distance #matrix #problem #search-based

A Genetic Algorithm for Solving the Euclidean Distance Matrices Completion Problem (WRG), pp. 286–290.

STOC-1998-AroraRR #approximate #problem

Approximation Schemes for Euclidean k-Medians and Related Problems (SA, PR, SR), pp. 106–113.

STOC-1998-LinialMS #metric

Trees and Euclidean Metrics (NL, AM, MES), pp. 169–175.

ICALP-1998-CzumajL #approximate #polynomial

A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity (AC, AL), pp. 682–694.

ICPR-1998-Huynh #analysis #image #re-engineering

Euclidean reconstruction from an image triplet: a sensitivity analysis (DQH), pp. 835–837.

ICPR-1998-KahlH #approximate #re-engineering #robust #self

Robust self-calibration and Euclidean reconstruction via affine approximation (FK, AH), pp. 56–58.

ICPR-1998-Rizzi #approach #clustering #graph #search-based

A genetic approach to hierarchical clustering of Euclidean graphs (SR), pp. 1543–1545.

STOC-1996-DeyG #algorithm

Algorithms for Manifolds and Simplicial Complexes in Euclidean 3-Space (Preliminary Version) (TKD, SG), pp. 398–407.

ICPR-1996-HeydenA #constant #parametricity #re-engineering

Euclidean reconstruction from constant intrinsic parameters (AH, KÅ), pp. 339–343.

ICPR-1996-Sinclair #constraints

The Euclidean hinge constraint in articulated motions (DS), pp. 707–711.

STOC-1995-AryaDMSS

Euclidean spanners: short, thin, and lanky (SA, GD, DMM, JSS, MHMS), pp. 489–498.