1326 search results - page 203 / 266 » Approximate Tree Kernels |
118
click to vote
FUZZIEEE
2007
IEEE
15 years 9 months ago
2007
IEEE
— DNA sequence basecalling is commonly regarded as a solved problem, despite significant error rates being reflected in inaccuracies in databases and genome annotations. This has...
133
click to vote
BIBE
2005
IEEE
15 years 9 months ago
2005
IEEE
We have recently demonstrated (La et al, Proteins, 58:2005) that sequence fragments approximating the overall familial phylogeny, called phylogenetic motifs (PMs), represent a pro...
145
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
140
click to vote
AOSD
2003
ACM
15 years 8 months ago
2003
ACM
We define a generic join point model for checking the Law of Demeter (LoD). Join points are trees, pointcuts are predicates over join points, and advice is checked statically sim...
123
click to vote
SIGGRAPH
2000
ACM
15 years 7 months ago
2000
ACM
Approximating detailed models with coarse, texture-mapped meshes results in polygonal silhouettes. To eliminate this artifact, we introduce silhouette clipping, a framework for ef...