Sciweavers

2424 search results - page 26 / 485
» A general algorithm for data dependence analysis
Sort
View
TCOM
2008
131views more  TCOM 2008»
14 years 10 months ago
Accurate estimation of the Hurst parameter of long-range dependent traffic using modified Allan and Hadamard variances
Abstract--Internet traffic exhibits self-similarity and longrange dependence (LRD) on various time scales. In this paper, we propose to use the Modified Allan Variance (MAVAR) and ...
Stefano Bregni, Luca Jmoda
ECRTS
2004
IEEE
15 years 1 months ago
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
Karsten Albers, Frank Slomka
DOCENG
2010
ACM
14 years 11 months ago
Linking data and presentations: from mapping to active transformations
Modern GUI toolkits, and especially RIA ones, propose the concept of binding to dynamically link domain data and their presentations. Bindings are very simple to use for predefine...
Olivier Beaudoux, Arnaud Blouin
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
15 years 10 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
ADBIS
2007
Springer
132views Database» more  ADBIS 2007»
15 years 4 months ago
Clustering Approach to Generalized Pattern Identification Based on Multi-instanced Objects with DARA
Clustering is an essential data mining task with various types of applications. Traditional clustering algorithms are based on a vector space model representation. A relational dat...
Rayner Alfred, Dimitar Kazakov