Sciweavers

291 search results - page 42 / 59
» Clustering and the Biclique Partition Problem
Sort
View
JPDC
2007
177views more  JPDC 2007»
13 years 9 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...
SAC
2004
ACM
14 years 2 months ago
Unsupervised learning techniques for an intrusion detection system
With the continuous evolution of the types of attacks against computer networks, traditional intrusion detection systems, based on pattern matching and static signatures, are incr...
Stefano Zanero, Sergio M. Savaresi
NIPS
2004
13 years 10 months ago
A Three Tiered Approach for Articulated Object Action Modeling and Recognition
Visual action recognition is an important problem in computer vision. In this paper, we propose a new method to probabilistically model and recognize actions of articulated object...
Le Lu, Gregory D. Hager, Laurent Younes
ALT
2009
Springer
14 years 6 months ago
Learning Unknown Graphs
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 6 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...