Sciweavers

2969 search results - page 184 / 594
» A space efficient algorithm for group structure computation
Sort
View
ILP
1998
Springer
15 years 8 months ago
Learning Structurally Indeterminate Clauses
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
Jean-Daniel Zucker, Jean-Gabriel Ganascia
143
Voted
VLDB
2002
ACM
106views Database» more  VLDB 2002»
15 years 3 months ago
Structure and Value Synopses for XML Data Graphs
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
Neoklis Polyzotis, Minos N. Garofalakis
CORR
2012
Springer
281views Education» more  CORR 2012»
13 years 11 months ago
Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
Lu Zheng, Ole J. Mengshoel, Jike Chong
148
Voted
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
14 years 10 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
133
Voted
VLDB
1991
ACM
143views Database» more  VLDB 1991»
15 years 7 months ago
Handling Data Skew in Multiprocessor Database Computers Using Partition Tuning
Shared nothing multiprocessor archit.ecture is known t.obe more scalable to support very large databases. Compared to other join strategies, a hash-ba9ed join algorithm is particu...
Kien A. Hua, Chiang Lee