Sciweavers

1298 search results - page 258 / 260
» The online set cover problem
Sort
View
CNSR
2004
IEEE
131views Communications» more  CNSR 2004»
13 years 11 months ago
Fast Flow Classification over Internet
In order to control and manage highly aggregated Internet traffic flows efficiently, we need to be able to categorize flows into distinct classes and to be knowledgeable about the...
A. Oveissian, Kavé Salamatian, Augustin Sou...
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
13 years 11 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
ATAL
2009
Springer
13 years 10 months ago
Choice, interoperability, and conformance in interaction protocols and service choreographies
Many real-world applications of multiagent systems require independently designed (heterogeneous) and operated (autonomous) agents to interoperate. We consider agents who offer bu...
Matteo Baldoni, Cristina Baroglio, Amit K. Chopra,...
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 7 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
KAIS
2008
150views more  KAIS 2008»
13 years 7 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng