Sciweavers

154 search results - page 10 / 31
» Clos Solutions to Binary Methods
Sort
View
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 8 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
JMIV
2006
161views more  JMIV 2006»
13 years 7 months ago
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization
This paper deals with the total variation minimization problem in image restoration for convex data fidelityfunctionals.Weproposeanewandfastalgorithmwhichcomputesanexactsolutionint...
Jérôme Darbon, Marc Sigelle
EOR
2007
70views more  EOR 2007»
13 years 7 months ago
Solving the maximum edge weight clique problem via unconstrained quadratic programming
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
Bahram Alidaee, Fred Glover, Gary A. Kochenberger,...
MMM
2005
Springer
152views Multimedia» more  MMM 2005»
14 years 1 months ago
Learning No-Reference Quality Metric by Examples
In this paper, a novel learning based method is proposed for No-Reference image quality assessment. Instead of examining the exact prior knowledge for the given type of distortion...
Hanghang Tong, Mingjing Li, HongJiang Zhang, Chang...
ICCV
2009
IEEE
14 years 11 months ago
Recovering Planar Homographies between 2D Shapes
Images taken from different views of a planar object are related by planar homography. Recovering the parameters of such transformations is a fundamental problem in computer vis...
Jozsef Nemeth, Csaba Domokos, Zoltan Kato