Sciweavers

3466 search results - page 398 / 694
» Fast computation of special resultants
Sort
View
RECOMB
2009
Springer
16 years 7 months ago
Searching Protein 3-D Structures in Linear Time
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...
Tetsuo Shibuya
MOBISYS
2009
ACM
16 years 7 months ago
mFerio: the design and evaluation of a peer-to-peer mobile payment system
In this paper, we present the design and evaluation of a nearfield communication-based mobile p2p payment application called mFerio which is designed to replace cash-based transac...
Rajesh Krishna Balan, Narayan Ramasubbu, Komsit Pr...
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 7 months ago
SPIRAL: efficient and exact model identification for hidden Markov models
Hidden Markov models (HMMs) have received considerable attention in various communities (e.g, speech recognition, neurology and bioinformatic) since many applications that use HMM...
Yasuhiro Fujiwara, Yasushi Sakurai, Masashi Yamamu...
HPCA
2003
IEEE
16 years 7 months ago
A Methodology for Designing Efficient On-Chip Interconnects on Well-Behaved Communication Patterns
As the level of chip integration continues to advance at a fast pace, the desire for efficient interconnects-whether on-chip or off-chip--is rapidly increasing. Traditional interc...
Wai Hong Ho, Timothy Mark Pinkston
RECOMB
2007
Springer
16 years 7 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader