381 search results - page 67 / 77 » On the advantage over a random assignment |
STOC
2007
ACM
14 years 8 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
GIS
2005
ACM
14 years 8 months ago
2005
ACM
Numerous raster maps are available on the Internet, but the geographic coordinates of the maps are often unknown. In order to determine the precise location of a raster map, we ex...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— The performance of wireless data systems has been thoroughly studied in the context of a single base station. In the present paper we analyze networks with several interacting ...