Sciweavers

2527 search results - page 461 / 506
» Discrete optimization in computer vision
Sort
View
IVC
2007
114views more  IVC 2007»
13 years 9 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
ICCV
2009
IEEE
1297views Computer Vision» more  ICCV 2009»
14 years 8 months ago
Effective and Efficient Interpolation for Mutual Information based Multimodality Elastic Image Registration
Mutual information (MI) is a popular similarity metric for multimodality image registration purpose. However, it is negatively influenced by artifacts due to interpolation effec...
R. Gallea, E. Ardizzone, R. Pirrone, O. Gambino
PODC
2009
ACM
14 years 10 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
FOCS
2009
IEEE
14 years 4 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
14 years 3 months ago
Evolving petri nets to represent metabolic pathways
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...
Jeremiah Nummela, Bryant A. Julstrom