5595 search results - page 885 / 1119 » Approximation Algorithms for Clustering Problems |
208
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
188
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
A new approach to computing a panoramic (360 degrees) depth map is presented in this paper. Our approach uses a large collection of images taken by a camera whose motion has been c...
181
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...
210
click to vote
ISPD
2012
ACM
14 years 2 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
205
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
We present an algorithm, Hierarchical ISOmetric SelfOrganizing Map (H-ISOSOM), for a concise, organized manifold representation of complex, non-linear, large scale, high-dimension...