18306 search results - page 421 / 3662 » Algorithmics in Exponential Time |
196
click to vote
COLT
2004
Springer
15 years 11 months ago
2004
Springer
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
201
click to vote
STACS
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
194
Voted
STOC
1995
ACM
15 years 11 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
202
click to vote
CBMS
2005
IEEE
15 years 9 months ago
2005
IEEE
In gene expression data a bicluster is a subset of genes and a subset of conditions which show correlating levels of expression. However, the problem of finding significant biclu...
231
Voted
SODA
2008
ACM
15 years 9 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...