681 search results - page 128 / 137 » General Polynomial Time Decomposition Algorithms |
ALMOB
2006
13 years 10 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
PODS
2008
ACM
14 years 10 months ago
2008
ACM
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
SODA
2012
ACM
12 years 7 days ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
SIGIR
2004
ACM
14 years 3 months ago
2004
ACM
The exponential growth of data demands scalable infrastructures capable of indexing and searching rich content such as text, music, and images. A promising direction is to combine...