Sciweavers

656 search results - page 33 / 132
» Minimal non-convex words
Sort
View
SCL
2008
109views more  SCL 2008»
14 years 11 months ago
A note on linear function approximation using random projections
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
Kishor Barman, Vivek S. Borkar
ORL
2008
87views more  ORL 2008»
14 years 10 months ago
On-line scheduling with non-crossing constraints
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
Lele Zhang, Kwanniti Khammuang, Andrew Wirth
FSMNLP
2005
Springer
15 years 5 months ago
German Compound Analysis with wfsc
Compounding is a very productive process in German to form complex nouns and adjectives which represent about 7% of the words of a newspaper text. Unlike English, German compounds ...
Anne Schiller
INFORMS
2010
147views more  INFORMS 2010»
14 years 8 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
CAGD
2011
14 years 6 months ago
Regularization of B-spline objects
By a d-dimensional B-spline object (denoted as Od ), we mean a B-spline curve (d = 1), a B-spline surface (d = 2) or a B-spline volume (d = 3). By regularization of a B-spline obj...
Guoliang Xu, Chandrajit L. Bajaj