Sciweavers

18306 search results - page 3307 / 3662
» Algorithmics in Exponential Time
Sort
View
CAD
2011
Springer
15 years 1 months ago
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
Ramanathan Muthuganapathy, Gershon Elber, Gill Bar...
CN
2011
88views more  CN 2011»
15 years 1 months ago
Multi-hour network planning based on domination between sets of traffic matrices
—In multi-hour network design, periodic traffic variations along time are considered in the dimensioning process. Then, the non coincidence of traffic peaks along the day or the ...
Pablo Pavón-Mariño, Belen Garcia-Man...
CORR
2011
Springer
261views Education» more  CORR 2011»
15 years 1 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
COLING
2010
15 years 1 months ago
Efficient Statement Identification for Automatic Market Forecasting
Strategic business decision making involves the analysis of market forecasts. Today, the identification and aggregation of relevant market statements is done by human experts, oft...
Henning Wachsmuth, Peter Prettenhofer, Benno Stein
DISOPT
2011
240views Education» more  DISOPT 2011»
15 years 1 months ago
On the directed Full Degree Spanning Tree problem
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
« Prev « First page 3307 / 3662 Last » Next »