8080 search results - page 126 / 1616 » Distributed Constrained Optimization |
144
Voted
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
110
click to vote
SIAMCO
2002
15 years 2 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
127
click to vote
CIAC
2000
Springer
15 years 6 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
176
click to vote
OOPSLA
1995
Springer
15 years 5 months ago
1995
Springer
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
111
click to vote
ISCA
2009
IEEE
15 years 9 months ago
2009
IEEE
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...