Sciweavers

570 search results - page 99 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
SIGMETRICS
2008
ACM
144views Hardware» more  SIGMETRICS 2008»
15 years 1 months ago
Co-designing the failure analysis and monitoring of large-scale systems
Large-scale distributed systems provide the backbone for numerous distributed applications and online services. These systems span over a multitude of computing nodes located at d...
Abhishek Chandra, Rohini Prinja, Sourabh Jain, Zhi...
SODA
2008
ACM
109views Algorithms» more  SODA 2008»
15 years 2 months ago
Auctions for structured procurement
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
Matthew Cary, Abraham D. Flaxman, Jason D. Hartlin...
IJCAI
2003
15 years 2 months ago
Optimal Time-Space Tradeoff in Probabilistic Inference
Recursive Conditioning, RC, is an any-space algorithm lor exact inference in Bayesian networks, which can trade space for time in increments of the size of a floating point number...
David Allen, Adnan Darwiche
FOCS
2004
IEEE
15 years 5 months ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler
UAI
2007
15 years 2 months ago
"I Can Name that Bayesian Network in Two Matrixes!"
The traditional approach to building Bayesian networks is to build the graphical structure using a graphical editor and then add probabilities using a separate spreadsheet for eac...
Russell Almond