Sciweavers

128 search results - page 24 / 26
» Comparing top k lists
Sort
View
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 6 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
KDD
2007
ACM
181views Data Mining» more  KDD 2007»
14 years 6 months ago
BoostCluster: boosting clustering by pairwise constraints
Data clustering is an important task in many disciplines. A large number of studies have attempted to improve clustering by using the side information that is often encoded as pai...
Yi Liu, Rong Jin, Anil K. Jain
MOBISYS
2004
ACM
14 years 5 months ago
Divert: Fine-grained Path Selection for Wireless LANs
The performance of Wireless Local Area Networks (WLANs) often suffers from link-layer frame losses caused by noise, interference, multipath, attenuation, and user mobility. We obs...
Allen K. L. Miu, Godfrey Tan, Hari Balakrishnan, J...
SIGIR
2009
ACM
14 years 8 days ago
Addressing morphological variation in alphabetic languages
The selection of indexing terms for representing documents is a key decision that limits how effective subsequent retrieval can be. Often stemming algorithms are used to normaliz...
Paul McNamee, Charles K. Nicholas, James Mayfield
ISCA
2007
IEEE
120views Hardware» more  ISCA 2007»
14 years 2 days ago
Examining ACE analysis reliability estimates using fault-injection
ACE analysis is a technique to provide an early reliability estimate for microprocessors. ACE analysis couples data from performance models with low level design details to identi...
Nicholas J. Wang, Aqeel Mahesri, Sanjay J. Patel