Sciweavers

256 search results - page 49 / 52
» A New Synchronous Lower Bound for Set Agreement
Sort
View
PODS
2008
ACM
128views Database» more  PODS 2008»
14 years 7 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren
SPAA
2010
ACM
14 years 16 days ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
AAAI
2010
13 years 9 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...
AMC
2007
102views more  AMC 2007»
13 years 7 months ago
Existence and computation of short-run equilibria in economic geography
The new economic geography literature provides a general equilibrium framework that explains the emergence of economic agglomerations as a trade-off between increasing returns at...
Nicos G. Pavlidis, Michael N. Vrahatis, P. Mossay
ALT
2004
Springer
14 years 4 months ago
On Kernels, Margins, and Low-Dimensional Mappings
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
Maria-Florina Balcan, Avrim Blum, Santosh Vempala