7228 search results - page 857 / 1446 » From Algorithmic to Subjective Randomness |
191
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
204
click to vote
COCO
2005
Springer
16 years 21 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
224
click to vote
SIGGRAPH
1995
ACM
15 years 10 months ago
1995
ACM
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals...
194
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
193
click to vote
SPAA
2004
ACM
16 years 18 days ago
2004
ACM
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...