Sciweavers

27692 search results - page 236 / 5539
» Where is ...
Sort
View
CPM
2005
Springer
125views Combinatorics» more  CPM 2005»
14 years 22 days ago
Parametric Analysis for Ungapped Markov Models of Evolution
We present efficient sensitivity-analysis algorithms for two problems involving Markov models of sequence evolution: ancestral reconstruction in evolutionary trees and local ungap...
David Fernández-Baca, Balaji Venkatachalam
PKC
2010
Springer
118views Cryptology» more  PKC 2010»
14 years 22 days ago
Text Search Protocols with Simulation Based Security
This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 hold...
Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen
CIS
2007
Springer
14 years 17 days ago
Security Assurance for Dynamic Role Mapping in a Multi-Domain Environment
Multi-domain application environments where distributed domains interoperate with each other are becoming a reality in Internet-based enterprise applications. The secure interoper...
Cuihua Zuo, Ruixuan Li, Hongmu Han, Zhengding Lu
ECMDAFA
2007
Springer
84views Hardware» more  ECMDAFA 2007»
14 years 17 days ago
A Practical Approach to Model Extension
In object technology, reusability is achieved primarily through class inheritance. In model engineering, where reusability is also important, it should be possible to extend a mode...
Mikaël Barbero, Frédéric Jouaul...
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
14 years 17 days ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha