Sciweavers

119 search results - page 5 / 24
» A relaxed approach to combinatorial problems in robustness a...
Sort
View
TCBB
2008
126views more  TCBB 2008»
13 years 8 months ago
Combinatorial Approaches for Mass Spectra Recalibration
Mass spectrometry has become one of the most popular analysis techniques in Proteomics and Systems Biology. With the creation of larger data sets, the automated recalibration of ma...
Sebastian Böcker, Veli Mäkinen
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
14 years 9 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
PPSN
1992
Springer
14 years 25 days ago
Hyperplane Annealing and Activator-Inhibitor-Systems
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
Thomas Laußermair
EMMCVPR
2005
Springer
14 years 2 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
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Robust solutions for combinatorial auctions
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Alan Holland, Barry O'Sullivan