2252 search results - page 293 / 451 » Lower Bounds for Dynamic Algorithms |
146
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
128
Voted
ACCV
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Detecting moving objects against dynamic backgrounds remains a challenge in computer vision and robotics. This paper presents a surprisingly simple algorithm to detect ob...
131
click to vote
IH
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetri...
151
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
138
Voted
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...