Sciweavers

5169 search results - page 799 / 1034
» Locality approximation using time
Sort
View
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
16 years 1 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein
CVPR
2010
IEEE
16 years 20 days ago
A Steiner Tree approach to efficient object detection
We propose an approach to speeding up object detection, with an emphasis on settings where multiple object classes are being detected. Our method uses a segmentation algorithm to ...
Olga Russakovsky, Quoc Le, Andrew Ng
ICC
2009
IEEE
15 years 11 months ago
A Laplace Transform-Based Method to Stochastic Path Finding
—Finding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay, when link metrics are defined as random variables by known probabili...
Suleyman Uludag, Ziyneti Elif Uludag, Klara Nahrst...
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
15 years 11 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
CANS
2009
Springer
120views Cryptology» more  CANS 2009»
15 years 11 months ago
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
Abstract. We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for additi...
Vladimir Kolesnikov, Ahmad-Reza Sadeghi, Thomas Sc...