Sciweavers

749 search results - page 56 / 150
» Combinatory Models and Symbolic Computation
Sort
View
ICPR
2008
IEEE
14 years 4 months ago
Embedding HMM's-based models in a Euclidean space: The topological hidden Markov models
One of the major limitations of HMM-based models is the inability to cope with topology: When applied to a visible observation (VO) sequence, HMM-based techniques have difficulty ...
Djamel Bouchaffra
EOR
2007
70views more  EOR 2007»
13 years 10 months ago
Solving the maximum edge weight clique problem via unconstrained quadratic programming
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
Bahram Alidaee, Fred Glover, Gary A. Kochenberger,...
LICS
2009
IEEE
14 years 4 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
ASIACRYPT
2009
Springer
14 years 4 months ago
On the Analysis of Cryptographic Assumptions in the Generic Ring Model
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
Tibor Jager, Jörg Schwenk
JCB
2008
90views more  JCB 2008»
13 years 10 months ago
A Simple Model of the Modular Structure of Transcriptional Regulation in Yeast
Resolving the general organizational principles that govern the interactions during transcriptional gene regulation has great relevance for understanding disease progression, biof...
Vladimir Filkov, Nameeta Shah