Sciweavers

570 search results - page 37 / 114
» Robustness and Implementability of Timed Automata
Sort
View
CCR
2000
75views more  CCR 2000»
14 years 11 months ago
The Eifel algorithm: making TCP robust against spurious retransmissions
We propose an enhancement to TCP's error recovery scheme, which we call the Eifel algorithm. It eliminates the retransmission ambiguity, thereby solving the problems caused b...
Reiner Ludwig, Randy H. Katz
GEOINFORMATICA
2008
123views more  GEOINFORMATICA 2008»
14 years 12 months ago
Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects
Topological relationships like overlap, inside, meet, and disjoint uniquely characterize the relative position between objects in space. For a long time, they have been a focus of...
Reasey Praing, Markus Schneider
INFOCOM
1998
IEEE
15 years 4 months ago
Implementing Distributed Packet Fair Queueing in a Scalable Switch Architecture
To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneo...
Donpaul C. Stephens, Hui Zhang
GLOBECOM
2009
IEEE
15 years 3 months ago
Compressed Sensing Reception of Bursty UWB Impulse Radio is Robust to Narrow-Band Interference
—We have recently proposed a novel receiver for Ultra-Wide-band Impulse-Radio communication in bursty applications like Wireless Sensor Networks. The receiver, based on the princ...
Anand Oka, Lutz H.-J. Lampe
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
14 years 12 months ago
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
Naama Mayer, Efi Fogel, Dan Halperin