Sciweavers

233 search results - page 32 / 47
» An Investigation of Practical Approximate Nearest Neighbor A...
Sort
View
123
Voted
SOFSEM
2007
Springer
15 years 6 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach
NETWORKING
2007
15 years 1 months ago
Location-Unaware Sensing Range Assignment in Sensor Networks
We study field-monitoring applications in which sensors are deployed in large numbers and the sensing process is expensive. In such applications, nodes should use the minimum poss...
Ossama Younis, Srinivasan Ramasubramanian, Marwan ...
90
Voted
ECCV
2000
Springer
16 years 2 months ago
Learning to Recognize 3D Objects with SNoW
This paper describes a novel view-based learning algorithm for 3D object recognition from 2D images using a network of linear units. The SNoW learning architecture is a sparse netw...
Ming-Hsuan Yang, Dan Roth, Narendra Ahuja
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 2 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
ICML
2004
IEEE
15 years 5 months ago
Learning a kernel matrix for nonlinear dimensionality reduction
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
Kilian Q. Weinberger, Fei Sha, Lawrence K. Saul