Sciweavers

5580 search results - page 1109 / 1116
» Randomized priority algorithms
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Distributed Opportunistic Scheduling for Ad-Hoc Communications Under Delay Constraints
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
Sheu-Sheu Tan, Dong Zheng, Junshan Zhang, James R....
INFOCOM
2010
IEEE
13 years 6 months ago
Compressive Oversampling for Robust Data Transmission in Sensor Networks
—Data loss in wireless sensing applications is inevitable and while there have been many attempts at coping with this issue, recent developments in the area of Compressive Sensin...
Zainul Charbiwala, Supriyo Chakraborty, Sadaf Zahe...
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...
« Prev « First page 1109 / 1116 Last » Next »