Sciweavers

455 search results - page 20 / 91
» A local approximation algorithm for maximum weight matching
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 6 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
ICMCS
2009
IEEE
215views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Image trimming via saliency region detection and iterative feature matching
Detection of saliency regions in images is useful for object based image understanding and object localization. In our work, we investigate a saliency region detection algorithm b...
Jiawei Huang, Ze-Nian Li
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 7 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
INFOCOM
2003
IEEE
14 years 21 days ago
Local Scheduling Policies in Networks of Packet Switches with Input Queues
— A significant research effort has been devoted in recent years to the design of simple and efficient scheduling policies for Input Queued (IQ) and Combined Input Output Queue...
Marco Ajmone Marsan, Paolo Giaccone, Emilio Leonar...
TIP
2008
169views more  TIP 2008»
13 years 7 months ago
Maximum Likelihood Wavelet Density Estimation With Applications to Image and Shape Matching
Density estimation for observational data plays an integral role in a broad spectrum of applications, e.g. statistical data analysis and information-theoretic image registration. ...
Adrian M. Peter, Anand Rangarajan