Sciweavers

7106 search results - page 24 / 1422
» Restricted Complexity, General Complexity
Sort
View
AIIA
2007
Springer
14 years 1 months ago
Structured Hidden Markov Model: A General Framework for Modeling Complex Sequences
Structured Hidden Markov Model (S-HMM) is a variant of Hierarchical Hidden Markov Model that shows interesting capabilities of extracting knowledge from symbolic sequences. In fact...
Ugo Galassi, Attilio Giordana, Lorenza Saitta
DLOG
2001
13 years 9 months ago
On Expressive Number Restrictions in Description Logics
We consider expressive Description Logics (ALCN) allowing for number restrictions on complex roles built with combinations of role constructors. In particular, we are mainly inter...
Fabio Grandi
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
13 years 12 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
SAT
2004
Springer
101views Hardware» more  SAT 2004»
14 years 27 days ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...
MOR
2002
94views more  MOR 2002»
13 years 7 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel