Sciweavers

4009 search results - page 146 / 802
» Clustering on Complex Graphs
Sort
View
CGF
1999
79views more  CGF 1999»
15 years 3 months ago
A Practical Analysis of Clustering Strategies for Hierarchical Radiosity
The calculation of radiant energy balance in complex scenes has been made possible by hierarchical radiosity methods based on clustering mechanisms. Although clustering offers an ...
Jean-Marc Hasenfratz, Cyrille Damez, Franço...
DM
2006
78views more  DM 2006»
15 years 3 months ago
On polynomial digraphs
Let (x, y) be a bivariate polynomial with complex coefficients. The zeroes of (x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(). This p...
Josep M. Brunat, Antonio Montes
AIRS
2006
Springer
15 years 7 months ago
A Novel Ant-Based Clustering Approach for Document Clustering
Recently, much research has been proposed using nature inspired algorithms to perform complex machine learning tasks. Ant Colony Optimization (ACO) is one such algorithm based on s...
Yulan He, Siu Cheung Hui, Yongxiang Sim
IPPS
2010
IEEE
15 years 1 months ago
Large-scale multi-dimensional document clustering on GPU clusters
Document clustering plays an important role in data mining systems. Recently, a flocking-based document clustering algorithm has been proposed to solve the problem through simulat...
Yongpeng Zhang, Frank Mueller, Xiaohui Cui, Thomas...
171
Voted
LCC
1994
213views Algorithms» more  LCC 1994»
15 years 8 months ago
Linear Constraint Query Languages: Expressive Power and Complexity
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
Stéphane Grumbach, Jianwen Su, Christophe T...