2168 search results - page 84 / 434 » Randomized Algorithms and Complexity Theory |
170
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
164
click to vote
ITC
2003
IEEE
15 years 11 months ago
2003
IEEE
Functional verification of complex designs largely relies on the use of simulation in conjunction high-level verification languages (HVL) and test-bench automation (TBA) tools. In...
142
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
172
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
180
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...