Sciweavers

2634 search results - page 9 / 527
» Faster Than Uppaal
Sort
View
BMCBI
2008
123views more  BMCBI 2008»
13 years 7 months ago
Shape based indexing for faster search of RNA family databases
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
Stefan Janssen, Jens Reeder, Robert Giegerich
CC
1999
Springer
154views System Software» more  CC 1999»
13 years 11 months ago
Faster Generalized LR Parsing
Tomita devised a method of generalized LR GLR parsing to parse ambiguous grammars e ciently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back...
John Aycock, R. Nigel Horspool
ICIP
2001
IEEE
14 years 9 months ago
Faster template matching without FFT
We consider the template matching problem, in which one wants to find all good enough occurrences of a pattern template P from a larger image I. The current standard of template m...
Kimmo Fredriksson, Esko Ukkonen
ICDT
2009
ACM
129views Database» more  ICDT 2009»
14 years 8 months ago
Faster join-projects and sparse matrix multiplications
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
Rasmus Resen Amossen, Rasmus Pagh
DATE
2009
IEEE
85views Hardware» more  DATE 2009»
14 years 2 months ago
Faster SAT solving with better CNF generation
Boolean satisfiability (SAT) solving has become an enabling technology with wide-ranging applications in numerous disciplines. These applications tend to be most naturally encode...
Benjamin Chambers, Panagiotis Manolios, Daron Vroo...