Sciweavers

1529 search results - page 195 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
NIPS
2007
15 years 5 months ago
An Analysis of Convex Relaxations for MAP Estimation
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
Pawan Mudigonda, Vladimir Kolmogorov, Philip H. S....
IJON
2008
88views more  IJON 2008»
15 years 4 months ago
Neural network construction and training using grammatical evolution
The term neural network evolution usually refers to network topology evolution leaving the network's parameters to be trained using conventional algorithms. In this paper we ...
Ioannis G. Tsoulos, Dimitris Gavrilis, Euripidis G...
CPAIOR
2010
Springer
15 years 9 months ago
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
Timo Berthold, Stefan Heinz, Marco E. Lübbeck...
PAMI
2006
132views more  PAMI 2006»
15 years 4 months ago
Capitalize on Dimensionality Increasing Techniques for Improving Face Recognition Grand Challenge Performance
This paper presents a novel pattern recognition framework by capitalizing on dimensionality increasing techniques. In particular, the framework integrates Gabor image representatio...
Chengjun Liu
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 8 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...