Sciweavers

274 search results - page 47 / 55
» Approximating Edit Distance Efficiently
Sort
View
104
Voted
CGF
2010
111views more  CGF 2010»
15 years 2 months ago
One Point Isometric Matching with the Heat Kernel
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...
Maks Ovsjanikov, Quentin Mérigot, Facundo M...
DKE
2006
125views more  DKE 2006»
15 years 2 months ago
Online clustering of parallel data streams
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
Jürgen Beringer, Eyke Hüllermeier
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
15 years 3 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
SI3D
1999
ACM
15 years 7 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha
CVPR
2008
IEEE
16 years 4 months ago
In defense of Nearest-Neighbor based image classification
State-of-the-art image classification methods require an intensive learning/training stage (using SVM, Boosting, etc.) In contrast, non-parametric Nearest-Neighbor (NN) based imag...
Oren Boiman, Eli Shechtman, Michal Irani