Sciweavers

843 search results - page 100 / 169
» A Graph-cut Based Algorithm For Approximate Mrf Optimization
Sort
View
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 4 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
DSD
2008
IEEE
166views Hardware» more  DSD 2008»
15 years 8 months ago
Pearson - based Analysis of Positioning Error Distribution in Wireless Sensor Networks
Abstract—In two recent contributions [1], [2], we have provided a comparative analysis of various optimization algorithms, which can be used for atomic location estimation, and s...
Stefano Tennina, Marco Di Renzo, Fabio Graziosi, F...
ICCAD
2009
IEEE
161views Hardware» more  ICCAD 2009»
14 years 11 months ago
The epsilon-approximation to discrete VT assignment for leakage power minimization
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...
Yujia Feng, Shiyan Hu
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
15 years 5 months ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell
NIPS
2007
15 years 3 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...