Sciweavers

18306 search results - page 68 / 3662
» Algorithmics in Exponential Time
Sort
View
DLOG
2007
15 years 4 months ago
Inverse Roles Make Conjunctive Queries Hard
Abstract. Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering...
Carsten Lutz
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 2 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
MYCRYPT
2005
Springer
189views Cryptology» more  MYCRYPT 2005»
15 years 7 months ago
An Analysis of Double Base Number Systems and a Sublinear Scalar Multiplication Algorithm
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = kˆ i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤   c + o(1) ¡ log n log log n ....
Mathieu Ciet, Francesco Sica
NIPS
2007
15 years 3 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
AUTOMATICA
2008
115views more  AUTOMATICA 2008»
15 years 2 months ago
Distributed algorithms for reaching consensus on general functions
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
Jorge Cortés