Sciweavers

868 search results - page 93 / 174
» A general compression algorithm that supports fast searching
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 9 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
HPDC
2008
IEEE
14 years 3 months ago
Ontological framework for a free-form query based grid search engine
If the model of free-form queries, which has proved successful for HTML based search on the Web, is made available for Grid services, it will serve as a powerful tool for scientis...
Chaitali Gupta, Rajdeep Bhowmik, Madhusudhan Govin...
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
14 years 9 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
CVPR
2010
IEEE
14 years 2 months ago
Facial Point Detection using Boosted Regression and Graph Models
Finding fiducial facial points in any frame of a video showing rich naturalistic facial behaviour is an unsolved problem. Yet this is a crucial step for geometric-featurebased fa...
Michel Valstar, Brais Martinez, Xavier Binefa, Maj...
VISUALIZATION
2000
IEEE
14 years 1 months ago
Isosurfacing in higher dimensions
Visualization algorithms have seen substantial improvements in the past several years. However, very few algorithms have been developed for directly studying data in dimensions hi...
Praveen Bhaniramka, Rephael Wenger, Roger Crawfis