Sciweavers

312 search results - page 56 / 63
» On k-optimal distributed constraint optimization algorithms:...
Sort
View
FOCS
2005
IEEE
14 years 2 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 9 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
TIP
2011
255views more  TIP 2011»
13 years 3 months ago
Dictionary Learning for Stereo Image Representation
—One of the major challenges in multi-view imaging is the definition of a representation that reveals the intrinsic geometry of the visual information. Sparse image representati...
Ivana Tosic, Pascal Frossard
BTW
2007
Springer
154views Database» more  BTW 2007»
14 years 2 months ago
Integrating Query-Feedback Based Statistics into Informix Dynamic Server
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...
Alexander Behm, Volker Markl, Peter J. Haas, Kesha...
TON
2002
99views more  TON 2002»
13 years 8 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda