Sciweavers

1599 search results - page 284 / 320
» Probabilistic Analysis of Anonymity
Sort
View
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 7 months ago
A Note on the Expected Time for Finding Maxima by List Algorithms
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
Luc Devroye
MOC
2002
131views more  MOC 2002»
13 years 7 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson
TSE
2002
99views more  TSE 2002»
13 years 7 months ago
Recovering Traceability Links between Code and Documentation
Software system documentation is almost always expressed informally in natural language and free text. Examples include requirement specifications, design documents, manual pages, ...
Giuliano Antoniol, Gerardo Canfora, Gerardo Casazz...
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 7 months ago
Towards a More Accurate Carrier Sensing Model for CSMA Wireless Networks
Abstract--In the majority of studies on CSMA wireless networks, a contention graph is used to model the carrier sensing relationships among links. This is a 0-1 model in which two ...
Caihong Kai, Soung Chang Liew
PAMI
2007
134views more  PAMI 2007»
13 years 7 months ago
Spatio-Temporal Context for Robust Multitarget Tracking
—In multitarget tracking, the main challenge is to maintain the correct identity of targets even under occlusions or when differences between the targets are small. The paper pro...
Hieu Tat Nguyen, Qiang Ji, Arnold W. M. Smeulders