Sciweavers

7006 search results - page 400 / 1402
» Approximation Algorithms
Sort
View
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
16 years 1 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
CORR
2008
Springer
147views Education» more  CORR 2008»
15 years 6 months ago
C-K-R Partitions of Sparse Graphs
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...
Manor Mendel, Chaya Schwob
CORR
2008
Springer
77views Education» more  CORR 2008»
15 years 6 months ago
Principal Graphs and Manifolds
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
Alexander N. Gorban, Andrei Yu. Zinovyev
COCOON
2005
Springer
16 years 8 days ago
New Streaming Algorithms for Counting Triangles in Graphs
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
Hossein Jowhari, Mohammad Ghodsi
IPCO
1996
104views Optimization» more  IPCO 1996»
15 years 8 months ago
An Optimal, Stable Continued Fraction Algorithm
We analyse a continued fraction algorithm (abbreviated CFA) for arbitrary dimension n showing that it produces simultaneous diophantine approximations which are up to the factor 2(...
Carsten Rössner, Claus-Peter Schnorr