Sciweavers

5115 search results - page 1017 / 1023
» On Randomized Lanczos Algorithms
Sort
View
LATINCRYPT
2010
13 years 6 months ago
Generic Attacks on Misty Schemes
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
Valérie Nachef, Jacques Patarin, Joana Treg...
OOPSLA
2010
Springer
13 years 6 months ago
Scalable and systematic detection of buggy inconsistencies in source code
Software developers often duplicate source code to replicate functionality. This practice can hinder the maintenance of a software project: bugs may arise when two identical code ...
Mark Gabel, Junfeng Yang, Yuan Yu, Moisés G...
PAMI
2010
190views more  PAMI 2010»
13 years 6 months ago
OBJCUT: Efficient Segmentation Using Top-Down and Bottom-Up Cues
—We present a probabilistic method for segmenting instances of a particular object category within an image. Our approach overcomes the deficiencies of previous segmentation tech...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
TON
2010
147views more  TON 2010»
13 years 6 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
GLOBECOM
2010
IEEE
13 years 6 months ago
Automatic Gain Control for ADC-Limited Communication
As the date rates and bandwidths of communication systems scale up, the cost and power consumption of highprecision (e.g., 8-12 bits) analog-to-digital converters (ADCs) become pro...
Feifei Sun, Jaspreet Singh, Upamanyu Madhow
« Prev « First page 1017 / 1023 Last » Next »