Sciweavers

676 search results - page 13 / 136
» Sub-stochastic matrix analysis for bounds computation - Theo...
Sort
View
DBA
2006
182views Database» more  DBA 2006»
13 years 8 months ago
Matrix Apriori: Speeding Up the Search for Frequent Patterns
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
Judith Pavón, Sidney Viana, Santiago G&oacu...
COMPGEOM
2011
ACM
12 years 11 months ago
Zigzag persistent homology in matrix multiplication time
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...
TELETRAFFIC
2007
Springer
14 years 1 months ago
On the Use of Accounting Data for QoS-Aware IP Network Planning
We present an economically efficient framework for provision of essential input for QoS-aware IP network planning. Firstly, we define a process for reuse of network accounting data...
Alan Davy, Dmitri Botvich, Brendan Jennings
ICC
2008
IEEE
118views Communications» more  ICC 2008»
14 years 1 months ago
Bounded-Variance Network Calculus: Computation of Tight Approximations of End-to-End Delay
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
Paolo Giacomazzi, Gabriella Saddemi
CVPR
2007
IEEE
14 years 9 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...