Sciweavers

451 search results - page 48 / 91
» Complexity of Data Flow Analysis for Non-Separable Framework...
Sort
View
CVPR
2007
IEEE
14 years 11 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...
CODES
2006
IEEE
14 years 3 months ago
The pipeline decomposition tree: : an analysis tool for multiprocessor implementation of image processing applications
Modern embedded systems for image processing involve increasingly complex levels of functionality under real-time and resourcerelated constraints. As this complexity increases, th...
Dong-Ik Ko, Shuvra S. Bhattacharyya
PAKDD
2010
ACM
193views Data Mining» more  PAKDD 2010»
13 years 7 months ago
As Time Goes by: Discovering Eras in Evolving Social Networks
Abstract. Within the large body of research in complex network analysis, an important topic is the temporal evolution of networks. Existing approaches aim at analyzing the evolutio...
Michele Berlingerio, Michele Coscia, Fosca Giannot...
ECML
2006
Springer
14 years 22 days ago
Unsupervised Multiple-Instance Learning for Functional Profiling of Genomic Data
Multiple-instance learning (MIL) is a popular concept among the AI community to support supervised learning applications in situations where only incomplete knowledge is available....
Corneliu Henegar, Karine Clément, Jean-Dani...
IPPS
2009
IEEE
14 years 3 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader