Sciweavers

173 search results - page 34 / 35
» An optimal randomized algorithm for maximum Tukey depth
Sort
View
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
14 years 3 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
COLT
2008
Springer
13 years 7 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 6 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
CVPR
2007
IEEE
14 years 8 months ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...
CVPR
2008
IEEE
14 years 8 months ago
Max Margin AND/OR Graph learning for parsing the human body
We present a novel structure learning method, Max Margin AND/OR Graph (MM-AOG), for parsing the human body into parts and recovering their poses. Our method represents the human b...
Long Zhu, Yuanhao Chen, Yifei Lu, Chenxi Lin, Alan...