Sciweavers

234 search results - page 15 / 47
» Randomized splay trees: Theoretical and experimental results
Sort
View
120
Voted
ANOR
2004
116views more  ANOR 2004»
15 years 1 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
ICNP
2003
IEEE
15 years 7 months ago
Characterizing Overlay Multicast Networks
Overlay networks among cooperating hosts have recently emerged as a viable solution to several challenging problems, including multicasting, routing, content distribution, and pee...
Sonia Fahmy, Minseok Kwon
156
Voted
ML
2012
ACM
413views Machine Learning» more  ML 2012»
13 years 9 months ago
Gradient-based boosting for statistical relational learning: The relational dependency network case
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...
WG
2005
Springer
15 years 7 months ago
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
Pascal Berthomé, Sylvain Lebresne, Kim Nguy...
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 8 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...