9209 search results - page 1547 / 1842 » Data Space Randomization |
171
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
156
click to vote
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
169
click to vote
MM
2006
ACM
15 years 11 months ago
2006
ACM
Conventional wide-area video surveillance systems use a network of fixed cameras positioned close to locations of interest. We describe an alternative and flexible approach to w...
162
Voted
SENSYS
2006
ACM
15 years 11 months ago
2006
ACM
Datalink layer framing in wireless sensor networks usually faces a trade-off between large frame sizes for high channel bandwidth utilization and small frame sizes for effective e...
143
click to vote
SIGCOMM
2006
ACM
15 years 11 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...