Sciweavers

1415 search results - page 237 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
PDIS
1996
IEEE
13 years 12 months ago
Querying the World Wide Web
The World Wide Web is a large, heterogeneous, distributedcollectionof documents connected by hypertext links. The most common technologycurrently used for searching the Web depend...
Alberto O. Mendelzon, George A. Mihaila, Tova Milo
CONCUR
2006
Springer
13 years 11 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
PRL
2002
91views more  PRL 2002»
13 years 7 months ago
StrCombo: combination of string recognizers
In this paper, we contribute a new paradigm of combining string recognizers and propose generic frameworks for hierarchical and parallel combination of multiple string recognizers...
Xiangyun Ye, Mohamed Cheriet, Ching Y. Suen
ISPDC
2010
IEEE
13 years 6 months ago
Practical Uniform Peer Sampling under Churn
—Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and the...
Roberto Baldoni, Marco Platania, Leonardo Querzoni...
PODC
2010
ACM
13 years 11 months ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...