Sciweavers

374 search results - page 58 / 75
» New Algorithms for Fast Discovery of Association Rules
Sort
View
INFOCOM
1998
IEEE
15 years 1 months ago
TCP Fast Recovery Strategies: Analysis and Improvements
This paper suggests that, to match an ideal Internet gateway which rigorously enforces fair sharing among competing TCP connections, an ideal TCP sender should possess two propert...
Dong Lin, H. T. Kung
SC
2000
ACM
15 years 1 months ago
A Unified Algorithm for Load-balancing Adaptive Scientific Simulations
Adaptive scientific simulations require that periodic repartitioning occur dynamically throughout the course of the computation. The repartitionings should be computed so as to mi...
Kirk Schloegel, George Karypis, Vipin Kumar
CORR
2010
Springer
167views Education» more  CORR 2010»
14 years 9 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
HIPC
2003
Springer
15 years 2 months ago
Parallel and Distributed Frequent Itemset Mining on Dynamic Datasets
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
Adriano Veloso, Matthew Eric Otey, Srinivasan Part...
AIIA
2005
Springer
15 years 3 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut