Sciweavers

102291 search results - page 20440 / 20459
» Computability in Computational Geometry
Sort
View
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
12 years 5 days ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
12 years 5 days ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
12 years 5 days ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
ISCA
2012
IEEE
302views Hardware» more  ISCA 2012»
12 years 4 days ago
Scale-out processors
The emergence of global-scale online services has galvanized scale-out software, characterized by splitting vast datasets and massive computation across many independent servers. ...
Pejman Lotfi-Kamran, Boris Grot, Michael Ferdman, ...
TVCG
2012
213views Hardware» more  TVCG 2012»
12 years 4 days ago
Mesh-Driven Vector Field Clustering and Visualization: An Image-Based Approach
—Vector field visualization techniques have evolved very rapidly over the last two decades, however, visualizing vector fields on complex boundary surfaces from computational ...
Zhenmin Peng, Edward Grundy, Robert S. Laramee, Gu...
« Prev « First page 20440 / 20459 Last » Next »