Sciweavers

943 search results - page 60 / 189
» How should data structures and algorithms be taught
Sort
View
ICDT
2007
ACM
126views Database» more  ICDT 2007»
15 years 3 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
CIDM
2007
IEEE
15 years 1 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
KDD
2002
ACM
194views Data Mining» more  KDD 2002»
15 years 10 months ago
Scale Space Exploration For Mining Image Information Content
Images are highly complex multidimensional signals, with rich and complicated information content. For this reason they are difficult to analyze through a unique automated approach...
Mariana Ciucu, Patrick Héas, Mihai Datcu, J...
BMCBI
2008
130views more  BMCBI 2008»
14 years 9 months ago
An enhanced partial order curve comparison algorithm and its application to analyzing protein folding trajectories
Background: Understanding how proteins fold is essential to our quest in discovering how life works at the molecular level. Current computation power enables researchers to produc...
Hong Sun, Hakan Ferhatosmanoglu, Motonori Ota, Yus...
CSB
2002
IEEE
103views Bioinformatics» more  CSB 2002»
15 years 2 months ago
Protein-Based Analysis of Alternative Splicing in the Human Genome
Understanding the functional significance of alternative splicing and other mechanisms that generate RNA transcript diversity is an important challenge facing modern-day molecular...
Ann E. Loraine, Gregg A. Helt, Melissa S. Cline, M...