Sciweavers

466 search results - page 48 / 94
» Preprocessing Search Spaces for Branch and Bound Search
Sort
View
SCALESPACE
2007
Springer
16 years 5 days ago
Linear Image Reconstruction by Sobolev Norms on the Bounded Domain
The reconstruction problem is usually formulated as a variational problem in which one searches for that image that minimizes a so called prior (image model) while insisting on cer...
Bart Janssen, Remco Duits, Bart M. ter Haar Romeny
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
13 years 8 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
BMCBI
2006
129views more  BMCBI 2006»
15 years 6 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
CVPR
2006
IEEE
16 years 8 months ago
A Design Principle for Coarse-to-Fine Classification
Coarse-to-fine classification is an efficient way of organizing object recognition in order to accommodate a large number of possible hypotheses and to systematically exploit shar...
Sachin Gangaputra, Donald Geman
CEC
2007
IEEE
16 years 12 days ago
A Memetic Algorithm for test data generation of Object-Oriented software
— Generating test data for Object-Oriented (OO) software is a hard task. Little work has been done on the subject, and a lot of open problems still need to be investigated. In th...
Andrea Arcuri, Xin Yao