Sciweavers

10414 search results - page 1952 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
161
Voted
NIPS
2004
15 years 4 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
SBBD
2004
89views Database» more  SBBD 2004»
15 years 4 months ago
DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...
Marcos R. Vieira, Caetano Traina Jr., Fabio Jun Ta...
UAI
2004
15 years 4 months ago
Probabilistic Index Maps for Modeling Natural Signals
One of the major problems in modeling natural signals is that signals with very similar structure may locally have completely different measurements, e.g., images taken under diff...
Nebojsa Jojic, Yaron Caspi, Manuel Reyes-Gomez
ACL
1996
15 years 4 months ago
Chart Generation
Charts constitute a natural uniform architecture for parsing and generation provided string position is replaced by a notion more appropriate to logical forms and that measures ar...
Martin Kay
SODA
1992
ACM
135views Algorithms» more  SODA 1992»
15 years 4 months ago
Applications of Parametric Searching in Geometric Optimization
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
« Prev « First page 1952 / 2083 Last » Next »