Sciweavers

680 search results - page 81 / 136
» Computational Complexity and Anytime Algorithm for Inconsist...
Sort
View
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
14 years 8 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
DAWAK
2003
Springer
14 years 1 months ago
Handling Large Workloads by Profiling and Clustering
View materialization is recognized to be one of the most effective ways to increase the Data Warehouse performance; nevertheless, due to the computational complexity of the techniq...
Matteo Golfarelli
ICC
2007
IEEE
136views Communications» more  ICC 2007»
14 years 2 months ago
Applying The Balanced Capacity Concept to DSL Systems
— This paper investigates a fair resource allocation method in crosstalk limited DSL (Digital Subscriber Line) systems. As a measure of fairness, the concept of Balanced Capacity...
Ali Kalakech, Jérôme Louveaux, Luc Va...
ICCV
1999
IEEE
14 years 10 months ago
The Hamilton-Jacobi Skeleton
The eikonal equation and variants of it are of significant interest for problems in computer vision and image processing. It is the basis for continuous versions of mathematical m...
Kaleem Siddiqi, Sylvain Bouix, Allen Tannenbaum, S...
PPOPP
2010
ACM
14 years 5 months ago
Application heartbeats for software performance and health
Adaptive, or self-aware, computing has been proposed to help application programmers confront the growing complexity of multicore software development. However, existing approache...
Henry Hoffmann, Jonathan Eastep, Marco D. Santambr...