Sciweavers

4007 search results - page 465 / 802
» Computation with imprecise probabilities
Sort
View
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
16 years 1 months ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...
TAMC
2009
Springer
16 years 1 months ago
Preserving Privacy versus Data Retention
The retention of communication data has recently attracted much public interest, mostly because of the possibility of its misuse. In this paper, we present protocols that address ...
Markus Hinkelmann, Andreas Jakoby
ICIP
2008
IEEE
16 years 1 months ago
On the security of non-forgeable robust hash functions
In many applications, it is often desirable to extract a consistent key from a multimedia object (e.g., an image), even when the object has gone through a noisy channel. For examp...
Qiming Li, Sujoy Roy
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
16 years 1 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
BROADNETS
2007
IEEE
16 years 1 months ago
Goodput optimization in CSMA/CA wireless networks
—Packet based wireless networks have provided high data rates, and the desire for ubiquitous wireless computing is growing rapidly. To accommodate these demands, wireless systems...
Yusun Chang, Christopher P. Lee, John A. Copeland