5247 search results - page 580 / 1050 » Frequency Optimized Computation Methods |
136
click to vote
GD
2005
Springer
15 years 10 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
154
click to vote
3DPVT
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper proposes a novel method for global registration based on matching 3D medial structures of unorganized point clouds or triangulated meshes. Most practical known methods ...
153
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
Shaping functions can be used in multi-task reinforcement learning (RL) to incorporate knowledge from previously experienced tasks to speed up learning on a new task. So far, rese...
140
click to vote
TCBB
2008
15 years 5 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
137
Voted
PR
2007
15 years 4 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...