2434 search results - page 367 / 487 » Algorithmic Randomness of Closed Sets |
147
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
130
Voted
IPSN
2009
Springer
15 years 10 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
116
Voted
BMCBI
2006
15 years 3 months ago
2006
Background: The recent advancement of microarray technology with lower noise and better affordability makes it possible to determine expression of several thousand genes simultane...
101
click to vote
COCO
2003
Springer
15 years 8 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
178
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...