Sciweavers

5230 search results - page 996 / 1046
» Dynamic Optimality -- Almost
Sort
View
DAC
2006
ACM
14 years 9 months ago
Fast algorithms for slew constrained minimum cost buffering
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...
Shiyan Hu, Charles J. Alpert, Jiang Hu, Shrirang K...
ICML
2006
IEEE
14 years 9 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
WWW
2008
ACM
14 years 9 months ago
Supporting anonymous location queries in mobile environments with privacygrid
This paper presents PrivacyGrid - a framework for supporting anonymous location-based queries in mobile information delivery systems. The PrivacyGrid framework offers three unique...
Bhuvan Bamba, Ling Liu, Péter Pesti, Ting W...
KDD
2009
ACM
249views Data Mining» more  KDD 2009»
14 years 9 months ago
Drosophila gene expression pattern annotation using sparse features and term-term interactions
The Drosophila gene expression pattern images document the spatial and temporal dynamics of gene expression and they are valuable tools for explicating the gene functions, interac...
Shuiwang Ji, Lei Yuan, Ying-Xin Li, Zhi-Hua Zhou, ...
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 9 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer