Sciweavers

157 search results - page 6 / 32
» Symmetrizations for clustering directed graphs
Sort
View
JPDC
2007
177views more  JPDC 2007»
13 years 7 months ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
ICPR
2008
IEEE
14 years 1 months ago
Object recognition using graph spectral invariants
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
Bai Xiao, Richard C. Wilson, Edwin R. Hancock
SIGIR
2008
ACM
13 years 6 months ago
Pagerank based clustering of hypertext document collections
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
Konstantin Avrachenkov, Vladimir Dobrynin, Danil N...
BMCBI
2008
145views more  BMCBI 2008»
13 years 7 months ago
Directed acyclic graph kernels for structural RNA analysis
Background: Recent discoveries of a large variety of important roles for non-coding RNAs (ncRNAs) have been reported by numerous researchers. In order to analyze ncRNAs by kernel ...
Kengo Sato, Toutai Mituyama, Kiyoshi Asai, Yasubum...
ICML
2008
IEEE
14 years 8 months ago
The skew spectrum of graphs
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
Risi Imre Kondor, Karsten M. Borgwardt