Sciweavers

811 search results - page 101 / 163
» An efficient algorithm for the configuration problem of domi...
Sort
View
AMDO
2006
Springer
14 years 20 days ago
Collision Detection Trough Deconstruction of Articulated Objects
Abstract. Many applications in computer graphics require fast and robust collision detection algorithms. The problem of simulating motion in an articulated chain has been well stud...
Roberto Therón, Vidal Moreno, Belén ...
CAINE
2009
13 years 6 months ago
Clustering Customer Transactions: A Rough Set Based Approach
An efficient customer behavior analysis is important for good Recommender System. Customer transaction clustering is usually the first step towards the analysis of customer behavi...
Arunava Saha, Darsana Das, Dipanjan Karmakar, Dili...
ANOR
2005
160views more  ANOR 2005»
13 years 8 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
ACMSE
2006
ACM
14 years 2 months ago
Discovering communities in complex networks
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
Hemant Balakrishnan, Narsingh Deo
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
14 years 9 months ago
Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
Bin Gao, Tie-Yan Liu, Xin Zheng, QianSheng Cheng, ...