Sciweavers

1594 search results - page 173 / 319
» Fast Prediction on a Tree
Sort
View
ALT
1995
Springer
13 years 12 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
CIKM
2008
Springer
13 years 10 months ago
A sparse gaussian processes classification framework for fast tag suggestions
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
Yang Song, Lu Zhang 0007, C. Lee Giles
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 9 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
TCBB
2010
104views more  TCBB 2010»
13 years 6 months ago
Fast Hinge Detection Algorithms for Flexible Protein Structures
— Analysis of conformational changes is one of the keys to the understanding of protein functions and interactions. For the analysis, we often compare two protein structures, tak...
Tetsuo Shibuya
BIBM
2010
IEEE
156views Bioinformatics» more  BIBM 2010»
13 years 6 months ago
Truncation of protein sequences for fast profile alignment with application to subcellular localization
We have recently found that the computation time of homology-based subcellular localization can be substantially reduced by aligning profiles up to the cleavage site positions of s...
Man-Wai Mak, Wei Wang, Sun-Yuan Kung