1431 search results - page 217 / 287 » The complexity of random ordered structures |
152
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
149
Voted
SISAP
2009
IEEE
15 years 10 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
128
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
137
Voted
SIAMDM
2008
15 years 3 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
137
Voted
SIGMOD
2008
ACM
15 years 3 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...