Sciweavers

1795 search results - page 233 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
113
Voted
VLDB
1991
ACM
157views Database» more  VLDB 1991»
15 years 4 months ago
Integrating Implicit Answers with Object-Oriented Queries
Queries in object-oriented datab;Lqcs are formulated against a class and retrieve instnnccls of the class sat,isfying a certain predicate on the att,riblltes of the class. The pre...
Hava T. Siegelmann, B. R. Badrinath
108
Voted
FOSSACS
2008
Springer
15 years 2 months ago
Model Checking Freeze LTL over One-Counter Automata
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
94
Voted
NIPS
2007
15 years 2 months ago
Expectation Maximization and Posterior Constraints
The expectation maximization (EM) algorithm is a widely used maximum likelihood estimation procedure for statistical models when the values of some of the variables in the model a...
João Graça, Kuzman Ganchev, Ben Task...
GRAPHICSINTERFACE
2001
15 years 2 months ago
Efficient View-dependent Rendering of Terrains
Though considerable progress has been made with the view-dependent techniques in terrain visualization, the CPU overhead still precludes their wide application in many domains. Th...
Yadong Wu, Yushu Liu, Shouyi Zhan, Chunxiao Gao
86
Voted
IJCAI
2003
15 years 2 months ago
Incremental Tractable Reasoning about Qualitative Temporal Constraints
In many applications of temporal reasoning we are in­ terested in reasoning incrementally In particular, given a CSP of temporal constrains and a new constraint, we want to maint...
Alfonso Gerevini