Sciweavers

730 search results - page 99 / 146
» Faster dimension reduction
Sort
View
ISW
2009
Springer
14 years 4 months ago
MAC Precomputation with Applications to Secure Memory
We present ShMAC (Shallow MAC), a fixed input length message authentication code that performs most of the computation prior to the availability of the message. Specifically, Sh...
Juan A. Garay, Vladimir Kolesnikov, Rae McLellan
SPIN
2009
Springer
14 years 4 months ago
Fast, All-Purpose State Storage
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
Peter C. Dillinger, Panagiotis Manolios
CRV
2008
IEEE
205views Robotics» more  CRV 2008»
14 years 4 months ago
Accurate Boundary Localization using Dynamic Programming on Snakes
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl...
INFOCOM
2008
IEEE
14 years 4 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...
WCNC
2008
IEEE
14 years 4 months ago
Arbutus: Network-Layer Load Balancing for Wireless Sensor Networks
—The hot spot problem is a typical byproduct of the many-to-one traffic pattern that characterizes most wireless sensor networks: the nodes with the best channel to the sink are ...
Daniele Puccinelli, Martin Haenggi