Sciweavers

1920 search results - page 373 / 384
» The Complexity of the A B C Problem
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
RECOMB
2002
Springer
14 years 9 months ago
Phase-independent rhythmic analysis of genome-wide expression patterns
We introduce a model-based analysis technique for extracting and characterizing rhythmic expression pro les from genome-wide DNA microarray hybridization data. These patterns are ...
Christopher James Langmead, Anthony K. Yan, C. Rob...
MOBISYS
2006
ACM
14 years 8 months ago
ARIADNE: a dynamic indoor signal map construction and localization system
Location determination of mobile users within a building has attracted much attention lately due to its many applications in mobile networking including network intrusion detectio...
Yiming Ji, Saad Biaz, Santosh Pandey, Prathima Agr...
SPAA
2009
ACM
14 years 5 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
PLDI
2009
ACM
14 years 3 months ago
Binary analysis for measurement and attribution of program performance
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...