Sciweavers

1064 search results - page 34 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
106
Voted
COR
2006
65views more  COR 2006»
15 years 3 months ago
An exact method for graph coloring
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
Corinne Lucet, Florence Mendes, Aziz Moukrim
137
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
16 years 4 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
145
Voted
CVPR
2001
IEEE
16 years 5 months ago
Simultaneous linear estimation of multiple view geometry and lens distortion
A bugbear of uncalibrated stereo reconstruction is that cameras which deviate from the pinhole model have to be pre-calibrated in order to correct for nonlinear lens distortion. I...
Andrew W. Fitzgibbon
COLING
2010
14 years 10 months ago
Opinion Summarization with Integer Linear Programming Formulation for Sentence Extraction and Ordering
In this paper we propose a novel algorithm for opinion summarization that takes account of content and coherence, simultaneously. We consider a summary as a sequence of sentences ...
Hitoshi Nishikawa, Takaaki Hasegawa, Yoshihiro Mat...