388 search results - page 29 / 78 » Convergence Properties of the K-Means Algorithms |
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
INFOCOM
1997
IEEE
15 years 5 months ago
1997
IEEE
In noncooperative networks, resources are shared among selfish users, which optimize their individual performance measure. We consider the generic and practically important case o...
127
click to vote
SIAMJO
2000
15 years 1 months ago
2000
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
ISBI
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper, we show that several well-known nonlinear surface registration algorithms can be put in an ICP-like framework, and thus boil down to the successive estimation of po...
118
click to vote
ICPP
2003
IEEE
15 years 6 months ago
2003
IEEE
This paper discusses the techniques of performing distributed page ranking on top of structured peer-to-peer networks. Distributed page ranking are needed because the size of the ...