Sciweavers

104 search results - page 16 / 21
» A Nearest Neighbor Method for Efficient ICP
Sort
View
JMLR
2010
367views more  JMLR 2010»
14 years 6 months ago
Locally Linear Denoising on Image Manifolds
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
Dian Gong, Fei Sha, Gérard G. Medioni
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 1 days ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
16 years 1 months ago
Distance Based Indexing for String Proximity Search
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
Jai Macker, Murat Tasan, Süleyman Cenk Sahina...
ESWS
2008
Springer
15 years 1 months ago
Query Answering and Ontology Population: An Inductive Approach
In order to overcome the limitations of deductive logic-based approaches to deriving operational knowledge from ontologies, especially when data come from distributed sources, indu...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito
SIAMSC
2008
206views more  SIAMSC 2008»
14 years 11 months ago
The Compact Discontinuous Galerkin (CDG) Method for Elliptic Problems
We present a compact discontinuous Galerkin (CDG) method for an elliptic model problem. The problem is first cast as a system of first order equations by introducing the gradient o...
Jaime Peraire, Per-Olof Persson