Sciweavers

7006 search results - page 398 / 1402
» Approximation Algorithms
Sort
View
CDC
2009
IEEE
183views Control Systems» more  CDC 2009»
15 years 8 months ago
Algorithms and stability analysis for content distribution over multiple multicast trees
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...
Xiaoying Zheng, Chunglae Cho, Ye Xia
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 5 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala
GEOINFO
2004
15 years 6 months ago
Approximate Spatial Query Processing using Raster Signatures
: Nowadays, the database characteristics, such as the huge volume of data, the complexity of the queries, and even the data availability, can demand minutes or hours to process a q...
Leonardo Guerreiro Azevedo, Rodrigo Salvador Monte...
FOCS
2003
IEEE
15 years 10 months ago
Paths, Trees, and Minimum Latency Tours
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, ...
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 14 days ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson