Sciweavers

1964 search results - page 201 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
CSB
2004
IEEE
124views Bioinformatics» more  CSB 2004»
13 years 12 months ago
Multiple RNA Structure Alignment
RNA structures can be viewed as a kind of special strings with some characters bonded with each other. The question of aligning two RNA structures has been studied for a while, an...
Zhuozhi Wang, Kaizhong Zhang
ICGI
2000
Springer
13 years 11 months ago
Computation of Substring Probabilities in Stochastic Grammars
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
Ana L. N. Fred
SIP
2007
13 years 9 months ago
Matting through variational inpainting
While current matting algorithms work very well for some natural images, their performance is questionable in the presence of sharp discontinuities in the foreground and backgroun...
Kangyu Ni, Sheshadri R. Thiruvenkadam, Tony F. Cha...
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 8 months ago
Finding low-weight polynomial multiples using discrete logarithm
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
Frédéric Didier, Yann Laigle-Chapuy
WWW
2006
ACM
14 years 8 months ago
WS-replication: a framework for highly available web services
Due to the rapid acceptance of web services and its fast spreading, a number of mission-critical systems will be deployed as web services in next years. The availability of those ...
Jorge Salas, Francisco Perez-Sorrosal, Marta Pati&...