94 search results - page 12 / 19 » An Analysis of Dynamic Severity and Population Size |
STOC
2004
ACM
16 years 1 days ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
107
click to vote
ICCAD
1995
IEEE
15 years 3 months ago
1995
IEEE
: We present several techniques for accelerating dynamic vector compaction for combinational and sequential circuits. A key feature of all our techniques is that they significantly...
118
click to vote
SIGMOD
2012
ACM
13 years 2 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
100
click to vote
CN
2007
14 years 11 months ago
2007
A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one ‘‘group key’’ is shared by all approved members. Ho...
126
click to vote
TC
2010
14 years 10 months ago
2010
—There are increasing interest and big challenge in designing a scalable and robust multicast routing protocol in a mobile ad hoc network (MANET) due to the difficulty in group ...