Sciweavers

616 search results - page 87 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
CSCWD
2008
Springer
13 years 9 months ago
Task partition for function tree according to innovative functional reasoning
Task partition is a critical problem of collaborative conceptual design. Aiming at the shortage that current task partition methods don't accord to innovative functional reas...
Yiming Tang, Xiaoping Liu
KDD
2010
ACM
277views Data Mining» more  KDD 2010»
13 years 11 months ago
Growing a tree in the forest: constructing folksonomies by integrating structured metadata
Many social Web sites allow users to annotate the content with descriptive metadata, such as tags, and more recently to organize content hierarchically. These types of structured ...
Anon Plangprasopchok, Kristina Lerman, Lise Getoor
IPPS
2008
IEEE
14 years 2 months ago
Junction tree decomposition for parallel exact inference
We present a junction tree decomposition based algorithm for parallel exact inference. This is a novel parallel exact inference method for evidence propagation in an arbitrary jun...
Yinglong Xia, Viktor K. Prasanna
ICCV
2007
IEEE
14 years 1 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
VIS
2004
IEEE
136views Visualization» more  VIS 2004»
14 years 8 months ago
Visibility Culling for Time-Varying Volume Rendering Using Temporal Occlusion Coherence
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...
Jinzhu Gao, Han-Wei Shen, Jian Huang, James Arthur...