2767 search results - page 228 / 554 » Universal Exponentiation Algorithm |
KDD
1998
ACM
15 years 6 months ago
1998
ACM
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...
123
click to vote
COLT
2004
Springer
15 years 6 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...
167
click to vote
CP
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
135
Voted
STACS
2000
Springer
15 years 6 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...
114
click to vote
STOC
1995
ACM
15 years 6 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...