Sciweavers

214 search results - page 9 / 43
» A Convex Programming Approach to the Trace Quotient Problem
Sort
View
EMMCVPR
2005
Springer
14 years 1 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
NIPS
2008
13 years 9 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
ARCS
2006
Springer
13 years 11 months ago
Large Event Traces in Parallel Performance Analysis
: A powerful and widely-used method for analyzing the performance behavior of parallel programs is event tracing. When an application is traced, performancerelevant events, such as...
Felix Wolf, Felix Freitag, Bernd Mohr, Shirley Moo...
ACMSE
2010
ACM
13 years 2 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
IOR
2008
109views more  IOR 2008»
13 years 7 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller