Sciweavers

14165 search results - page 2724 / 2833
» The generalized two-server problem
Sort
View
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 8 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh
ADC
2006
Springer
125views Database» more  ADC 2006»
15 years 8 months ago
A reconstruction-based algorithm for classification rules hiding
Data sharing between two organizations is common in many application areas e.g. business planing or marketing. Useful global patterns can be discovered from the integrated dataset...
Juggapong Natwichai, Xue Li, Maria E. Orlowska
ANCS
2006
ACM
15 years 8 months ago
Packet classification using coarse-grained tuple spaces
While the problem of high performance packet classification has received a great deal of attention in recent years, the research community has yet to develop algorithmic methods t...
Haoyu Song, Jonathan S. Turner, Sarang Dharmapurik...
ATAL
2006
Springer
15 years 8 months ago
Efficient agent-based cluster ensembles
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
Adrian K. Agogino, Kagan Tumer
ATAL
2006
Springer
15 years 8 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
« Prev « First page 2724 / 2833 Last » Next »