Sciweavers

330 search results - page 20 / 66
» Approximation Algorithms for the Directed k-Tour and k-Strol...
Sort
View
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
16 years 14 days ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
ICPR
2008
IEEE
16 years 12 days ago
Regression with interval output values
We consider a regression problem where target values are given as intervals, and propose a statistical approach to it. Although it is hard to solve the optimization problem direct...
Hisashi Kashima, Kazutaka Yamasaki, Akihiro Inokuc...
INFOCOM
2007
IEEE
16 years 8 days ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
15 years 11 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
COMPGEOM
2004
ACM
15 years 11 months ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...