5580 search results - page 864 / 1116 » Randomized priority algorithms |
121
Voted
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
110
click to vote
QEST
2005
IEEE
15 years 8 months ago
2005
IEEE
A framework to assess transient performance measures is introduced by generalizing the theory of the quasi Birthand-Death (QBD) paradigm to QBDs with marked time epochs (QBDm ). T...
119
click to vote
SRDS
2005
IEEE
15 years 8 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
124
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
CIKM
2005
Springer
15 years 8 months ago
2005
Springer
Record deduplication is the task of merging database records that refer to the same underlying entity. In relational databases, accurate deduplication for records of one type is o...