Sciweavers

608 search results - page 82 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
SODA
2010
ACM
160views Algorithms» more  SODA 2010»
14 years 5 months ago
Solving Simple Stochastic Tail Games
Stochastic games are a natural model for open reactive processes: one player represents the controller and his opponent represents a hostile environment. The evolution of the syste...
Hugo Gimbert, Florian Horn
CN
2008
108views more  CN 2008»
13 years 7 months ago
Finding a dense-core in Jellyfish graphs
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 8 months ago
Hardness of routing with congestion in directed graphs
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...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
ICDE
2006
IEEE
428views Database» more  ICDE 2006»
14 years 9 months ago
Integrating Unstructured Data into Relational Databases
In this paper we present a system for automatically integrating unstructured text into a multi-relational database using state-of-the-art statistical models for structure extracti...
Imran R. Mansuri, Sunita Sarawagi
COLT
2000
Springer
14 years 1 days ago
Bias-Variance Error Bounds for Temporal Difference Updates
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
Michael J. Kearns, Satinder P. Singh