Sciweavers

152 search results - page 26 / 31
» Discovering Identity Problems: A Case Study
Sort
View
JCO
2010
99views more  JCO 2010»
13 years 8 months ago
Online scheduling with a buffer on related machines
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
György Dósa, Leah Epstein
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
14 years 1 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
ALMOB
2006
138views more  ALMOB 2006»
13 years 10 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
WAOA
2010
Springer
236views Algorithms» more  WAOA 2010»
13 years 7 months ago
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
Patrick Briest, Heiko Röglin
ICDCS
2012
IEEE
12 years 7 days ago
Tiresias: Online Anomaly Detection for Hierarchical Operational Network Data
Operational network data, management data such as customer care call logs and equipment system logs, is a very important source of information for network operators to detect prob...
Chi-Yao Hong, Matthew Caesar, Nick G. Duffield, Ji...