Sciweavers

6251 search results - page 1121 / 1251
» Randomness, Computability, and Density
Sort
View
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 10 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
CHI
2007
ACM
14 years 10 months ago
Using heart rate to control an interactive game
This paper presents a novel way of using real-time heart rate information to control a physically interactive biathlon (skiing and shooting) computer game. Instead of interfacing ...
Aleksi Lindblad, Mikko Jouhtio, Perttu Häm&au...
RECOMB
2004
Springer
14 years 10 months ago
The evolutionary capacity of protein structures
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ro...
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 7 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
ICDCS
2009
IEEE
14 years 7 months ago
A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems
In distributed storage systems, erasure codes represent an attractive solution to add redundancy to stored data while limiting the storage overhead. They are able to provide the s...
Alessandro Duminuco, Ernst W. Biersack
« Prev « First page 1121 / 1251 Last » Next »