Sciweavers

4690 search results - page 740 / 938
» Synchronized Data Distribution Management in Distributed Sim...
Sort
View
COLT
2010
Springer
15 years 4 months ago
Forest Density Estimation
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...
INFOCOM
2011
IEEE
14 years 10 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
MANSCI
2007
90views more  MANSCI 2007»
15 years 6 months ago
Selecting a Selection Procedure
Selection procedures are used in a variety of applications to select the best of a finite set of alternatives. ‘Best’ is defined with respect to the largest mean, but the me...
Jürgen Branke, Stephen E. Chick, Christian Sc...
OSDI
2002
ACM
16 years 6 months ago
TCP Nice: A Mechanism for Background Transfers
Many distributed applications can make use of large background transfers ? transfers of data that humans are not waiting for ? to improve availability, reliability, latency or con...
Arun Venkataramani, Ravi Kokku, Michael Dahlin
ICDCS
2009
IEEE
16 years 3 months ago
Graduated QoS by Decomposing Bursts: Don't Let the Tail Wag Your Server
The growing popularity of hosted storage services and shared storage infrastructure in data centers is driving the recent interest in resource management and QoS in storage system...
Lanyue Lu, Peter J. Varman, Kshitij Doshi