2542 search results - page 477 / 509 » Computing Cartograms with Optimal Complexity |
129
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Getting trapped in suboptimal local minima is a perennial problem in model based vision, especially in applications like monocular human body tracking where complex nonlinear para...
234
click to vote
POPL
2006
ACM
16 years 3 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
145
click to vote
PPOPP
2010
ACM
15 years 10 months ago
2010
ACM
This paper presents an analytical model to predict the performance of general-purpose applications on a GPU architecture. The model is designed to provide performance information ...
158
click to vote
ICDCN
2009
Springer
15 years 10 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
129
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Today’s wirelessly networked embedded systems underlie a vast array of electronic devices, performing computation, communication, and input/output. A major design goal...