108 search results - page 6 / 22 » Finding diamonds in the rough |
SIGCSE
2004
ACM
15 years 2 months ago
2004
ACM
Finding just the right example to answer a question can be difficult for CS1 students and teachers. For this to work well there must be an intuitive interface coupled to an approp...
125
click to vote
RECOMB
2001
Springer
15 years 9 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
ARSCOM
2008
14 years 9 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
KAIS
2000
14 years 9 months ago
2000
When data sets are analyzed, statistical pattern recognition is often used to find the information hidden in the data. Another approach to information discovery is data mining. Dat...
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
The analysis of colored surface textures is a challenging research problem in computer vision. Current approaches to this task can be roughly divided into two categories: methods ...