Sciweavers

4095 search results - page 328 / 819
» How to test a tree
Sort
View
ESANN
2004
15 years 6 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk
BMCBI
2006
156views more  BMCBI 2006»
15 years 5 months ago
Detecting the limits of regulatory element conservation and divergence estimation using pairwise and multiple alignments
Background: Molecular evolutionary studies of noncoding sequences rely on multiple alignments. Yet how multiple alignment accuracy varies across sequence types, tree topologies, d...
Daniel A. Pollard, Alan M. Moses, Venky N. Iyer, M...
CVPR
2007
IEEE
16 years 7 months ago
Maximally Stable Colour Regions for Recognition and Matching
This paper introduces a novel colour-based affine covariant region detector. Our algorithm is an extension of the maximally stable extremal region (MSER) to colour. The extension ...
Per-Erik Forssén
SIGCSE
2009
ACM
119views Education» more  SIGCSE 2009»
16 years 6 months ago
Implications of integrating test-driven development into CS1/CS2 curricula
Many academic and industry professionals have called for more testing in computer science curricula. Test-driven development (TDD) has been proposed as a solution to improve testi...
Chetan Desai, David S. Janzen, John Clements
CHI
2006
ACM
16 years 5 months ago
Getting the right design and the design right
We present a study comparing usability testing of a single interface versus three functionally equivalent but stylistically distinct designs. We found that when presented with a s...
Maryam Tohidi, William Buxton, Ronald Baecker, Abi...