Sciweavers

5153 search results - page 683 / 1031
» Introduction to Randomized Algorithms
Sort
View
ACIVS
2006
Springer
15 years 10 months ago
Adaptive Vision Leveraging Digital Retinas: Extracting Meaningful Segments
In general, the less probable an event, the more attention we pay to it. Likewise, considering visual perception, it is interesting to regard important image features as those that...
Nicolas Burrus, Thierry M. Bernard
CEC
2005
IEEE
15 years 10 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
NCA
2005
IEEE
15 years 10 months ago
Cooperative Mobile Agents to Gather Global Information
Abstract— This paper describes an original approach to writing reactive algorithms on highly dynamic networks. We propose to use randomly mobile agents to gather global informati...
Michel Charpentier, Gérard Padiou, Philippe...
144
Voted
ADHOCNOW
2005
Springer
15 years 10 months ago
Cache Placement in Sensor Networks Under Update Cost Constraint
— In this paper, we address an optimization problem that arises in context of cache placement in sensor networks. In particular, we consider the cache placement problem where the...
Bin Tang, Samir R. Das, Himanshu Gupta
CCS
2005
ACM
15 years 10 months ago
Untraceable RFID tags via insubvertible encryption
We introduce a new cryptographic primitive, called insubvertible encryption, that produces ciphertexts which can be randomized without the need of any key material. Unlike plain u...
Giuseppe Ateniese, Jan Camenisch, Breno de Medeiro...