Sciweavers

16404 search results - page 2828 / 3281
» A set coverage problem
Sort
View
MOR
2010
118views more  MOR 2010»
15 years 5 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
MST
2010
98views more  MST 2010»
15 years 5 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
NOMS
2010
IEEE
180views Communications» more  NOMS 2010»
15 years 5 months ago
Performance-driven task co-scheduling for MapReduce environments
—MapReduce is a data-driven programming model proposed by Google in 2004 which is especially well suited for distributed data analytics applications. We consider the management o...
Jorda Polo, David Carrera, Yolanda Becerra, Malgor...
P2P
2010
IEEE
144views Communications» more  P2P 2010»
15 years 5 months ago
Hivory: Range Queries on Hierarchical Voronoi Overlays
Abstract—The problem of defining a support for multidimensional range queries on P2P overlays is currently an active field of research. Several approaches based on the extensio...
Matteo Mordacchini, Laura Ricci, Luca Ferrucci, Mi...
PAMI
2010
160views more  PAMI 2010»
15 years 5 months ago
Photometric Stereo via Expectation Maximization
—This paper presents a robust and automatic approach to photometric stereo, where the two main components, namely surface normals and visible surfaces, are respectively optimized...
Tai-Pang Wu, Chi-Keung Tang
« Prev « First page 2828 / 3281 Last » Next »