Sciweavers

1760 search results - page 30 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
CVBIA
2005
Springer
14 years 1 months ago
Active Contours Under Topology Control Genus Preserving Level Sets
We present a novel framework to exert topology control over a level set evolution. Level set methods offer several advantages over parametric active contours, in particular automat...
Florent Ségonne, Jean-Philippe Pons, W. Eri...
IPMI
2009
Springer
14 years 2 months ago
Generalized L2-Divergence and Its Application to Shape Alignment
This paper proposes a novel and robust approach to the groupwise point-sets registration problem in the presence of large amounts of noise and outliers. Each of the point sets is r...
Fei Wang, Baba C. Vemuri, Tanveer Fathima Syeda-Ma...
OL
2011
242views Neural Networks» more  OL 2011»
13 years 2 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
14 years 1 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
WWW
2008
ACM
14 years 8 months ago
Learning to rank relational objects and its application to web search
Learning to rank is a new statistical learning technology on creating a ranking model for sorting objects. The technology has been successfully applied to web search, and is becom...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, De-Sheng Wang...