Sciweavers

2569 search results - page 165 / 514
» Approximate Objects and Approximate Theories
Sort
View
223
Voted
SAGA
2007
Springer
16 years 1 months ago
Probabilistic Techniques in Algorithmic Game Theory
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Spyros C. Kontogiannis, Paul G. Spirakis
168
Voted
CVPR
2005
IEEE
16 years 9 months ago
Asymmetrical Occlusion Handling Using Graph Cut for Multi-View Stereo
Occlusion is usually modelled in two images symmetrically in previous stereo algorithms which cannot work for multi-view stereo efficiently. In this paper, we present a novel form...
Yichen Wei, Long Quan
DCC
2009
IEEE
16 years 7 months ago
Compressive-Projection Principal Component Analysis and the First Eigenvector
An analysis is presented that extends existing Rayleigh-Ritz theory to the special case of highly eccentric distributions. Specifically, a bound on the angle between the first Rit...
James E. Fowler
214
Voted
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
16 years 7 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
16 years 3 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller