Sciweavers

1199 search results - page 28 / 240
» How to Compare the Power of Computational Models
Sort
View
ECIR
2006
Springer
15 years 1 months ago
An Efficient Computation of the Multiple-Bernoulli Language Model
Abstract. The Multiple Bernoulli (MB) Language Model has been generally considered too computationally expensive for practical purposes and superseded by the more efficient multino...
Leif Azzopardi, David E. Losada
WABI
2007
Springer
139views Bioinformatics» more  WABI 2007»
15 years 5 months ago
Computability of Models for Sequence Assembly
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
Paul Medvedev, Konstantinos Georgiou, Gene Myers, ...
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
14 years 11 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
FCCM
2005
IEEE
115views VLSI» more  FCCM 2005»
15 years 5 months ago
FIFO Communication Models in Operating Systems for Reconfigurable Computing
Increasing demands upon embedded systems for higher level services like networking, user interfaces and file system management, are driving growth in fully-featured operating syst...
John A. Williams, Neil W. Bergmann, X. Xie
CVPR
2000
IEEE
16 years 1 months ago
A Computational Model for Repeated Pattern Perception Using Frieze and Wallpaper Groups
Humans have an innate ability to perceive symmetry, but it is not obvious how to automate this powerful insight. In this paper the mathematical theory of Frieze and wallpaper grou...
Yanxi Liu, Robert T. Collins