Sciweavers

796 search results - page 65 / 160
» Generalized Commitment Alignment
Sort
View
BMCBI
2011
14 years 5 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
15 years 8 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
118
Voted
JUCS
2010
114views more  JUCS 2010»
15 years 21 days ago
Deontic Logic-based Framework for Ontology Aligment in Agent Communities
: In this paper we consider a multiagent system with multiple ontologies. The agents maintain the ontologies individually which leads to frequent changes and possible knowledge inc...
Grzegorz Kolaczek, Krzysztof Juszczyszyn
TARK
2009
Springer
15 years 8 months ago
Program equilibria and discounted computation time
Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite twoplayer game where each player can base their strategy on the other player’s strategies. Tennen...
Lance Fortnow
ICML
2004
IEEE
16 years 3 months ago
A graphical model for protein secondary structure prediction
In this paper, we present a graphical model for protein secondary structure prediction. This model extends segmental semi-Markov models (SSMM) to exploit multiple sequence alignme...
Wei Chu, Zoubin Ghahramani, David L. Wild