Sciweavers

1192 search results - page 143 / 239
» Computing Weakest Readings
Sort
View
103
Voted
ICALP
1998
Springer
15 years 8 months ago
Power of Cooperation and Multihead Finite Systems
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other head...
Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowsk...
126
Voted
PODC
1997
ACM
15 years 8 months ago
Determining Consensus Numbers
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
Eric Ruppert
125
Voted
RECOMB
2010
Springer
15 years 7 months ago
MoGUL: Detecting Common Insertions and Deletions in a Population
Abstract. While the discovery of structural variants in the human population is ongoing, most methods for this task assume that the genome is sequenced to high coverage (e.g. 40x),...
Seunghak Lee, Eric Xing, Michael Brudno
126
Voted
PODC
1991
ACM
15 years 7 months ago
Randomized Wait-Free Concurrent Objects (Extended Abstract)
d abstract) Maurice Herlihy Digital Equipment Corporation Cambridge Research Laboratory One Kendall Square Cambridge MA, 02139 Digital Equipment Corporation Cambridge Research Lab ...
Maurice Herlihy
119
Voted
PODC
2010
ACM
15 years 5 months ago
Distributed data classification in sensor networks
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., ...
Ittay Eyal, Idit Keidar, Raphael Rom