Sciweavers

125 search results - page 22 / 25
» ams 2000
Sort
View
SIAMJO
2000
101views more  SIAMJO 2000»
14 years 9 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
GI
2005
Springer
15 years 3 months ago
Kooperative Roboter im studentischen Softwarepraktikum
: Die Arbeitsgruppe Echtzeitsysteme und Kommunikation an der Fakultät für Informatik der Otto-von-Guericke-Universität Magdeburg nutzt die Attraktivität von Roboterbaukästen, ...
Edgar Nett, Manuela Kanneberg
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
14 years 10 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
JAL
2002
113views more  JAL 2002»
14 years 9 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
MOR
2010
120views more  MOR 2010»
14 years 8 months ago
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz In
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
Hedy Attouch, Jérôme Bolte, Patrick R...