10051 search results - page 1457 / 2011 » A Dynamic Separator Algorithm |
199
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
210
click to vote
PPOPP
2011
ACM
14 years 9 months ago
2011
ACM
We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potent...
234
click to vote
MOBIHOC
2012
ACM
13 years 9 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
235
click to vote
MOBIHOC
2012
ACM
13 years 9 months ago
2012
ACM
With recent advances in Software-defined Radios (SDRs), it has indeed became feasible to dynamically adapt the channel widths at smaller time scales. Even though the advantages o...
202
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...