2743 search results - page 386 / 549 » Minimization of an M-convex Function |
145
click to vote
EOR
2010
15 years 6 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
163
click to vote
CSDA
2006
15 years 5 months ago
2006
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
172
click to vote
SIAMSC
2008
15 years 5 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
141
click to vote
EPIA
1999
Springer
15 years 10 months ago
1999
Springer
We present two models of hierarchical structured multi-agents, and we describe how to obtain a modal knowledge base from distributed sources. We then propose a computationally orie...
136
click to vote
ICALP
1998
Springer
15 years 10 months ago
1998
Springer
It is well known that the performance of quicksort can be improved by selecting the median of a sample of elements as the pivot of each partitioning stage. For large samples the pa...