Sciweavers

18306 search results - page 97 / 3662
» Algorithmics in Exponential Time
Sort
View
AAAI
2008
15 years 6 days ago
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
Hoifung Poon, Pedro Domingos, Marc Sumner
PVLDB
2010
103views more  PVLDB 2010»
14 years 8 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
15 years 3 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
FOCS
2007
IEEE
15 years 4 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx
CDC
2008
IEEE
182views Control Systems» more  CDC 2008»
15 years 4 months ago
Practical stability of time delay systems: LMI's approach
— In this paper we discuss the practical stability of a class of time delay systems with an unstable equilibrium. We obtain sufficient conditions based on Lyapunov-Krasovskii fu...
Raul Villafuerte, Sabine Mondie, Alexander S. Pozn...