Sciweavers

1225 search results - page 199 / 245
» The Instance Complexity Conjecture
Sort
View
CCR
2011
13 years 4 months ago
Misbehaviors in TCP SACK generation
While analyzing CAIDA Internet traces of TCP traffic to detect instances of data reneging, we frequently observed seven misbehaviors in the generation of SACKs. These misbehaviors...
Nasif Ekiz, Abuthahir Habeeb Rahman, Paul D. Amer
CORR
2011
Springer
206views Education» more  CORR 2011»
13 years 4 months ago
Arrangement Computation for Planar Algebraic Curves
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
Eric Berberich, Pavel Emeliyanenko, Alexander Kobe...
MOBILIGHT
2010
13 years 3 months ago
Stealthy Compromise of Wireless Sensor Nodes with Power Analysis Attacks
Node capture is considered as one of the most critical issues in the security of wireless sensor networks. A popular approach to thwart the problem relies on the detection of event...
Giacomo de Meulenaer, François-Xavier Stand...
PAMI
2010
162views more  PAMI 2010»
13 years 3 months ago
Differential Earth Mover's Distance with Its Applications to Visual Tracking
The Earth Mover's Distance (EMD) is a similarity measure that captures perceptual difference between two distributions. Its computational complexity, however, prevents a direc...
Qi Zhao, Zhi Yang, Hai Tao
TON
2010
126views more  TON 2010»
13 years 3 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai