1982 search results - page 119 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
214
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
213
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important...
229
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Content-based dissemination of XML data using the publishsubscribe paradigm is an effective means to deliver relevant data to interested data consumers. To meet the performance ch...
114
click to vote
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
130
click to vote
TCS
2002
15 years 4 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...