Sciweavers

301 search results - page 47 / 61
» The k-Median Problem for Directed Trees
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 25 days ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
INFOCOM
1998
IEEE
13 years 11 months ago
Active Reliable Multicast
Abstract--This paper presents a novel loss recovery scheme, Active Reliable Multicast (ARM), for large-scale reliable multicast. ARM is "active" in that routers in the mu...
Li-Wei H. Lehman, Stephen J. Garland, David L. Ten...
IACR
2011
134views more  IACR 2011»
12 years 7 months ago
Concise Vector Commitments and their Applications to Zero-Knowledge Elementary Databases
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
Dario Catalano, Dario Fiore
VLDB
2007
ACM
181views Database» more  VLDB 2007»
14 years 7 months ago
STAR: Self-Tuning Aggregation for Scalable Monitoring
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...