Sciweavers

3991 search results - page 230 / 799
» Bounding homogeneous models
Sort
View
176
Voted
FOCS
2009
IEEE
15 years 11 months 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
COMPGEOM
2009
ACM
15 years 10 months ago
Cache-oblivious range reporting with optimal queries requires superlinear space
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
111
Voted
ALT
2008
Springer
16 years 1 months ago
Clustering with Interactive Feedback
In this paper, we initiate a theoretical study of the problem of clustering data under interactive feedback. We introduce a query-based model in which users can provide feedback to...
Maria-Florina Balcan, Avrim Blum
COLT
2006
Springer
15 years 8 months ago
Online Tracking of Linear Subspaces
We address the problem of online de-noising a stream of input points. We assume that the clean data is embedded in a linear subspace. We present two online algorithms for tracking ...
Koby Crammer
164
Voted
AMC
2011
14 years 11 months ago
Approximate inverse-free preconditioners for Toeplitz matrices
In this paper, we propose approximate inverse-free preconditioners for solving Toeplitz systems. The preconditioners are constructed based on the famous Gohberg-Sememcul formula. ...
You-Wei Wen, Wai-Ki Ching, Michael Ng