520 search results - page 30 / 104 » New Complexity Results for Classical Planning Benchmarks |
112
Voted
RECOMB
2006
Springer
16 years 25 days ago
2006
Springer
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
116
Voted
ICANN
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A new classification algorithm based on combination of kernel density estimators is introduced. The method combines the estimators with different bandwidths what can be i...
133
click to vote
COCO
2009
Springer
15 years 7 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
113
click to vote
ICDE
2007
IEEE
15 years 6 months ago
2007
IEEE
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
111
Voted
STOC
1993
ACM
15 years 4 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...