Sciweavers

664 search results - page 71 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
ECCV
2008
Springer
15 years 11 months ago
Beyond Loose LP-Relaxations: Optimizing MRFs by Repairing Cycles
This paper presents a new MRF optimization algorithm, which is derived from Linear Programming and manages to go beyond current state-of-the-art techniques (such as those based on ...
Nikos Komodakis, Nikos Paragios
PR
2008
88views more  PR 2008»
14 years 9 months ago
Modified global k
Clustering in gene expression data sets is a challenging problem. Different algorithms for clustering of genes have been proposed. However due to the large number of genes only a ...
Adil M. Bagirov
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 3 months ago
Exploring extended particle swarms: a genetic programming approach
Particle Swarm Optimisation (PSO) uses a population of particles that fly over the fitness landscape in search of an optimal solution. The particles are controlled by forces tha...
Riccardo Poli, Cecilia Di Chio, William B. Langdon
ICIP
2003
IEEE
15 years 11 months ago
Robust line detection using a weighted MSE estimator
In this paper we introduce a novel line detection algorithm based on a weighted minimum mean square error (MSE) formulation. This algorithm has been developed to enable an autonom...
Guido M. Schuster, Aggelos K. Katsaggelos
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
15 years 3 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke