176 search results - page 13 / 36 » A Clustering Approach to Solving Large Stochastic Matching P... |
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
We present an unsupervised, shape-based method for joint clustering of multiple image segmentations. Given two or more closely-related images, such as nearby frames in a video seq...
VTC
2008
IEEE
14 years 3 months ago
2008
IEEE
— One of the unique characteristics of ultra-wideband channels is the clustering phenomenon resolved by the ultra-wide signal bandwidth. Channel structures extended from the Sale...
ACSC
2005
IEEE
14 years 2 months ago
2005
IEEE
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
CCGRID
2003
IEEE
14 years 1 months ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...