Sciweavers

12257 search results - page 2073 / 2452
» Analysis of Algorithms
Sort
View
KDD
2003
ACM
160views Data Mining» more  KDD 2003»
16 years 5 months ago
Playing hide-and-seek with correlations
We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method cons...
Chris Jermaine
135
Voted
KDD
2002
ACM
125views Data Mining» more  KDD 2002»
16 years 5 months ago
Pattern discovery in sequences under a Markov assumption
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
Darya Chudova, Padhraic Smyth
CHI
2005
ACM
16 years 5 months ago
Interactive search in large video collections
We present a search interface for large video collections with time-aligned text transcripts. The system is designed for users such as intelligence analysts that need to quickly f...
Andreas Girgensohn, John Adcock, Matthew L. Cooper...
VLSID
2007
IEEE
104views VLSI» more  VLSID 2007»
16 years 5 months ago
Customization of Register File Banking Architecture for Low Power
Register file banking is an effective alternative to monolithic register files in embedded processor based systems. In this work, we propose techniques for performing application s...
Rakesh Nalluri, Rohan Garg, Preeti Ranjan Panda
POPL
2007
ACM
16 years 5 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
« Prev « First page 2073 / 2452 Last » Next »