2342 search results - page 261 / 469 » Sublinear geometric algorithms |
143
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
We propose a family of clustering algorithms based on the maximization of dependence between the input variables and their cluster labels, as expressed by the Hilbert-Schmidt Inde...
109
click to vote
ISBI
2009
IEEE
15 years 10 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...
142
click to vote
ICCCN
2008
IEEE
15 years 10 months ago
2008
IEEE
—Observing that simplicity implies efficiency and scalability, this paper proposes a position-based deployment and routing strategy, and then gives a concrete approach under this...
133
click to vote
ICNSC
2008
IEEE
15 years 10 months ago
2008
IEEE
— A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. I...
145
Voted
SYNASC
2008
IEEE
15 years 10 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...