Sciweavers

2178 search results - page 200 / 436
» Inferring complex plans
Sort
View
AAAI
2011
14 years 4 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
166
Voted
CORR
2012
Springer
214views Education» more  CORR 2012»
13 years 11 months ago
Sum-Product Networks: A New Deep Architecture
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
Hoifung Poon, Pedro Domingos
CSCW
2012
ACM
13 years 11 months ago
Social coding in GitHub: transparency and collaboration in an open software repository
Social applications on the web let users track and follow the activities of a large number of others regardless of location or affiliation. There is a potential for this transpare...
Laura A. Dabbish, H. Colleen Stuart, Jason Tsay, J...
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
15 years 10 months ago
Optimizing Multiple Queries in Distributed Data Stream Systems
We consider the problem of query optimization in distributed stream based systems where multiple continuous queries may be executing simultaneously. In such systems, distribution ...
Sangeetha Seshadri, Vibhore Kumar, Brian F. Cooper
VLDB
1998
ACM
138views Database» more  VLDB 1998»
15 years 8 months ago
TOPAZ: a Cost-Based, Rule-Driven, Multi-Phase Parallelizer
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
Clara Nippl, Bernhard Mitschang