Sciweavers

4541 search results - page 477 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
209
Voted
FOCS
2009
IEEE
16 years 27 days ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
175
Voted
IUI
2004
ACM
15 years 11 months ago
WOLD: a mixed-initiative wizard for producing multi-platform user interfaces
WOLD (Wizard fOr Leveraging the Development of multi-platform user interfaces) helps designers to produce running user interfaces to data bases of information systems simultaneous...
Julien Stocq, Jean Vanderdonckt
EDBT
2010
ACM
210views Database» more  EDBT 2010»
15 years 8 months ago
Keyword search for data-centric XML collections with long text fields
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Current approaches for supporting such queries are either for textcentric XM...
Arash Termehchy, Marianne Winslett
CORR
2010
Springer
249views Education» more  CORR 2010»
15 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
ECCV
2000
Springer
15 years 10 months ago
Factorization with Uncertainty
Factorization using Singular Value Decomposition (SVD) is often used for recovering 3D shape and motion from feature correspondences across multiple views. SVD is powerful at find...
Michal Irani, P. Anandan