Sciweavers

944 search results - page 75 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
FOCS
2002
IEEE
15 years 3 months ago
Implicit B-Trees: New Results for the Dictionary Problem
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...
Gianni Franceschini, Roberto Grossi, J. Ian Munro,...
ICMLA
2007
14 years 11 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio
CPAIOR
2009
Springer
15 years 4 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
IJCV
2006
227views more  IJCV 2006»
14 years 10 months ago
A Multigrid Platform for Real-Time Motion Computation with Discontinuity-Preserving Variational Methods
Variational methods are among the most accurate techniques for estimating the optic flow. They yield dense flow fields and can be designed such that they preserve discontinuities, ...
Andrés Bruhn, Joachim Weickert, Timo Kohlbe...
72
Voted
EVOW
2004
Springer
15 years 3 months ago
Evolutionary Search of Thresholds for Robust Feature Set Selection: Application to the Analysis of Microarray Data
Abstract. We deal with two important problems in pattern recognition that arise in the analysis of large datasets. While most feature subset selection methods use statistical techn...
Carlos Cotta, Christian Sloper, Pablo Moscato