Sciweavers

213 search results - page 15 / 43
» An Approximation Algorithm for Binary Searching in Trees
Sort
View
CORR
2008
Springer
167views Education» more  CORR 2008»
13 years 7 months ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud
ICML
2005
IEEE
14 years 8 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
ECIR
2006
Springer
13 years 9 months ago
Improving Quality of Search Results Clustering with Approximate Matrix Factorisations
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
Stanislaw Osinski
CVPR
1997
IEEE
14 years 9 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
14 years 2 months ago
Cross-Mining Binary and Numerical Attributes
We consider the problem of relating itemsets mined on binary attributes of a data set to numerical attributes of the same data. An example is biogeographical data, where the numer...
Gemma C. Garriga, Hannes Heikinheimo, Jouni K. Sep...