Sciweavers

253 search results - page 49 / 51
» Faster Approximation of Distances in Graphs
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 6 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
JOIN
2007
91views more  JOIN 2007»
13 years 6 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
CVPR
2000
IEEE
14 years 8 months ago
A General Method for Errors-in-Variables Problems in Computer Vision
The Errors-in-Variables (EIV) model from statistics is often employed in computer vision thoughonlyrarely under this name. In an EIV model all the measurements are corrupted by no...
Bogdan Matei, Peter Meer
ICMI
2007
Springer
138views Biometrics» more  ICMI 2007»
14 years 25 days ago
Speech-filtered bubble ray: improving target acquisition on display walls
The rapid development of large interactive wall displays has been accompanied by research on methods that allow people to interact with the display at a distance. The basic method...
Edward Tse, Mark S. Hancock, Saul Greenberg
SIGMETRICS
2003
ACM
165views Hardware» more  SIGMETRICS 2003»
13 years 12 months ago
A hybrid systems modeling framework for fast and accurate simulation of data communication networks
In this paper we present a general hybrid systems modeling framework to describe the flow of traffic in communication networks. To characterize network behavior, these models use...
Stephan Bohacek, João P. Hespanha, Junsoo L...