Sciweavers

3946 search results - page 631 / 790
» The computational complexity of choice sets
Sort
View
HPDC
2010
IEEE
15 years 7 months ago
Characterising a grid site's traffic
Grid computing has been widely adopted for intensive high performance computing. Since grid resources are distributed over complex large-scale infrastructures, understanding grid ...
Tiejun Ma, Yehia El-khatib, Michael Mackay, Christ...
ECCV
2006
Springer
16 years 8 months ago
Figure/Ground Assignment in Natural Images
Abstract. Figure/ground assignment is a key step in perceptual organization which assigns contours to one of the two abutting regions, providing information about occlusion and all...
Xiaofeng Ren, Charless Fowlkes, Jitendra Malik
ICDCN
2009
Springer
16 years 1 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
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, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...
CLUSTER
2008
IEEE
16 years 1 months ago
Active CoordinaTion (ACT) - toward effectively managing virtualized multicore clouds
—A key benefit of utility data centers and cloud computing infrastructures is the level of consolidation they can offer to arbitrary guest applications, and the substantial savi...
Mukil Kesavan, Adit Ranadive, Ada Gavrilovska, Kar...
FOCS
2005
IEEE
16 years 5 days ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...