4171 search results - page 204 / 835 » Distributed Data Structure Design for Scientific Computation |
186
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
232
click to vote
ICDT
2012
ACM
13 years 9 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
152
click to vote
ICANN
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. We present a novel approach to structure learning for graphical models. By using nonparametric estimates to model clique densities in decomposable models, both discrete a...
188
click to vote
TVCG
2008
15 years 6 months ago
2008
Building visualization and analysis pipelines is a large hurdle in the adoption of visualization and workflow systems by domain scientists. In this paper, we propose techniques to ...
182
click to vote
AAAI
2006
15 years 8 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...