Sciweavers

3820 search results - page 597 / 764
» Bounded Model Debugging
Sort
View
ESORICS
2004
Springer
15 years 8 months ago
Comparison Between Two Practical Mix Designs
We evaluate the anonymity provided by two popular email mix implementations, Mixmaster and Reliable, and compare their effectiveness through the use of simulations which model th...
Claudia Díaz, Len Sassaman, Evelyne Dewitte
136
Voted
ICALP
2004
Springer
15 years 8 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
182
Voted
IFIP
2004
Springer
15 years 8 months ago
The Inherent Queuing Delay of Parallel Packet Switches
The parallel packet switch (PPS) extends the inverse multiplexing architecture, and is extensively used as the core of contemporary commercial switches. A key factor in the perfor...
Hagit Attiya, David Hay
122
Voted
IPSN
2004
Springer
15 years 8 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
COMPGEOM
2003
ACM
15 years 7 months ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson