1806 search results - page 190 / 362 » Randomness and halting probabilities |
225
Voted
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
136
Voted
WABI
2009
Springer
15 years 10 months ago
2009
Springer
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...
157
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
148
Voted
MOBICOM
2005
ACM
15 years 9 months ago
2005
ACM
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...
132
Voted
LICS
2000
IEEE
15 years 8 months ago
2000
IEEE
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...