Sciweavers

1110 search results - page 38 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 12 days ago
A Unified Approach to Approximate Proximity Searching
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
CVPR
2007
IEEE
16 years 1 months ago
Fast, Approximately Optimal Solutions for Single and Dynamic MRFs
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
15 years 4 months ago
A constant-factor approximately optimal solution to the Witsenhausen counterexample
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
Se Yong Park, Pulkit Grover, Anant Sahai
INFOCOM
2006
IEEE
15 years 5 months ago
Adaptive Admission Control Algorithm for Multiuser OFDMA Wireless Networks
—We propose a new adaptive admission control scheme for multiuser OFDMA systems to allocate wireless resource with low complexity. In this adaptive admission control scheme, the ...
Kyung-Ho Sohn, Jongkyung Kim, Tae Sung Kim, Young ...
EOR
2002
105views more  EOR 2002»
14 years 11 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler