Sciweavers

26354 search results - page 5043 / 5271
» How we refactor, and how we know it
Sort
View
CAV
2009
Springer
165views Hardware» more  CAV 2009»
16 years 2 months ago
Symbolic Counter Abstraction for Concurrent Software
Counter Abstraction for Concurrent Software G?erard Basler1 , Michele Mazzucchi1 , Thomas Wahl1,2 , Daniel Kroening1,2 1 Computer Systems Institute, ETH Zurich, Switzerland 2 Compu...
Daniel Kroening, Gérard Basler, Michele Maz...
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
16 years 2 months ago
Multi-focal learning and its application to customer service support
In this study, we formalize a multi-focal learning problem, where training data are partitioned into several different focal groups and the prediction model will be learned within...
Yong Ge, Hui Xiong, Wenjun Zhou, Ramendra K. Sahoo...
MOBISYS
2009
ACM
16 years 2 months ago
Leveraging smart phones to reduce mobility footprints
Mobility footprint refers to the size, weight, and energy demand of the hardware that must be carried by a mobile user to be effective at any time and place. The ideal of a zero m...
Stephen Smaldone, Benjamin Gilbert, Nilton Bila, L...
KDD
2007
ACM
201views Data Mining» more  KDD 2007»
16 years 2 months ago
Structural and temporal analysis of the blogosphere through community factorization
The blogosphere has unique structural and temporal properties since blogs are typically used as communication media among human individuals. In this paper, we propose a novel tech...
Yun Chi, Shenghuo Zhu, Xiaodan Song, Jun'ichi Tate...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 2 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
« Prev « First page 5043 / 5271 Last » Next »