Sciweavers

1632 search results - page 40 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
IJCAI
2003
15 years 4 months ago
Optimal Time-Space Tradeoff in Probabilistic Inference
Recursive Conditioning, RC, is an any-space algorithm lor exact inference in Bayesian networks, which can trade space for time in increments of the size of a floating point number...
David Allen, Adnan Darwiche
121
Voted
CIKM
1997
Springer
15 years 7 months ago
Block Addressing Indices for Approximate Text Retrieval
Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, t...
Ricardo A. Baeza-Yates, Gonzalo Navarro
SODA
2010
ACM
167views Algorithms» more  SODA 2010»
16 years 22 days ago
Inapproximability for planar embedding problems
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios ...
FOCS
2003
IEEE
15 years 8 months ago
List-Decoding Using The XOR Lemma
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
Luca Trevisan
STACS
2010
Springer
15 years 10 months ago
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
Bireswar Das, Jacobo Torán, Fabian Wagner