Sciweavers

2188 search results - page 244 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
143
Voted
ICML
2007
IEEE
16 years 4 months ago
A dependence maximization view of clustering
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...
Le Song, Alexander J. Smola, Arthur Gretton, Karst...
ISBI
2009
IEEE
15 years 10 months ago
Prior Affinity Measures on Matches for ICP-Like Nonlinear Registration of Free-Form Surfaces
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...
Benoît Combès, Sylvain Prima
ICCCN
2008
IEEE
15 years 10 months ago
A Position-Based Deployment and Routing Approach for Directional Wireless Mesh Networks
—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...
Weisheng Si, Selvakennedy Selvadurai
ICNSC
2008
IEEE
15 years 10 months ago
Facility Location Optimization via Multi-Agent Robotic Systems
— 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...
Miad Moarref, Hassan Sayyadi
145
Voted
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
15 years 9 months ago
Graph Rewriting in Computational Origami
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 ...
Tetsuo Ida