2342 search results - page 105 / 469 » Sublinear geometric algorithms |
198
click to vote
VLDB
2007
ACM
16 years 1 months ago
2007
ACM
We propose a novel string search algorithm for data stored once and read many times. Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-M...
129
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
135
Voted
GCB
2004
Springer
15 years 4 months ago
2004
Springer
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
115
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...