Sciweavers

705 search results - page 19 / 141
» Proximity Cluster Trees
Sort
View
WWW
2006
ACM
14 years 8 months ago
Discovering event evolution graphs from newswires
In this paper, we propose an approach to automatically mine event evolution graphs from newswires on the Web. Event evolution graph is a directed graph in which the vertices and e...
Christopher C. Yang, Xiaodong Shi
IWOCA
2009
Springer
134views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Combinatorial Models for Cooperation Networks
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
Michael Drmota, Bernhard Gittenberger, Reinhard Ku...
CP
2010
Springer
13 years 5 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex
ICCV
2005
IEEE
14 years 9 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu
CLUSTER
2006
IEEE
14 years 1 months ago
Automatic Clustering for Self-Organizing Grids
Computational grids have not scaled effectively due to administrative hurdles to resource and user participation. Most production grids are essentially multi-site supercomputer ce...
Weishuai Yang, Nael B. Abu-Ghazaleh, Michael J. Le...