2107 search results - page 109 / 422 » Computing Small Search Numbers in Linear Time |
148
Voted
FCT
2003
Springer
15 years 8 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
128
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
140
click to vote
PODC
2006
ACM
15 years 9 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
114
Voted
DNA
2009
Springer
15 years 10 months ago
2009
Springer
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
135
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...