Sciweavers

712 search results - page 36 / 143
» The Complexity of Constructing Evolutionary Trees Using Expe...
Sort
View
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
14 years 11 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens
127
Voted
CVIU
2011
14 years 1 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
70
Voted
STACS
2010
Springer
15 years 5 months ago
Unsatisfiable Linear CNF Formulas Are Large and Complex
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
Dominik Scheder
106
Voted
BIBE
2007
IEEE
145views Bioinformatics» more  BIBE 2007»
15 years 4 months ago
Homomorphisms of Multisource Trees into Networks with Applications to Metabolic Pathways
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...
Qiong Cheng, Robert W. Harrison, Alexander Zelikov...
130
Voted
ACMSE
2011
ACM
13 years 10 months ago
Targeting FPGA-based processors for an implementation-driven compiler construction course
This paper describes the adaptation of a modern compiler construction course to target an FPGA-based hardware platform used throughout our computer science curriculum. One of the ...
D. Brian Larkins, William M. Jones