Sciweavers

167 search results - page 31 / 34
» A class of polynomially solvable linear complementarity prob...
Sort
View
119
Voted
DAGSTUHL
1997
15 years 1 months ago
Scattered Data Techniques for Surfaces
This survey presents several techniques for solving variants of the following scattered data interpolation problem: given a nite set of N points in R3, nd a surface that interpola...
Suresh K. Lodha, Richard Franke
107
Voted
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 5 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
CVIU
2011
14 years 3 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
TSP
2008
117views more  TSP 2008»
15 years 7 days ago
A Theory for Sampling Signals From a Union of Subspaces
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
Yue M. Lu, Minh N. Do
91
Voted
RECOMB
1997
Springer
15 years 4 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...