9871 search results - page 312 / 1975 » On the Structure of Low Sets |
205
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
152
click to vote
NIPS
2004
15 years 8 months ago
2004
X-ray crystallography is currently the most common way protein structures are elucidated. One of the most time-consuming steps in the crystallographic process is interpretation of...
175
click to vote
UAI
2004
15 years 8 months ago
2004
In recent years, there is a growing interest in learning Bayesian networks with continuous variables. Learning the structure of such networks is a computationally expensive proced...
158
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
155
click to vote
IJAR
2008
15 years 6 months ago
2008
When an incremental structural learning method gradually modifies a Bayesian network (BN) structure to fit observations, as they are read from a database, we call the process stru...