Sciweavers

1670 search results - page 124 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
CHI
2009
ACM
16 years 3 months ago
Using temporal patterns (t-patterns) to derive stress factors of routine tasks
We describe the use of a statistical technique called Tpattern analysis to derive and characterize the routineness of tasks. T-patterns provide significant advantages over traditi...
Oliver Brdiczka, Norman Makoto Su, Bo Begole
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 3 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
MOBIDE
2005
ACM
15 years 8 months ago
Video-streaming for fast moving users in 3G mobile networks
The emergence of third-generation (3G) mobile networks offers new opportunities for the effective delivery of data with rich content including multimedia messaging and video-strea...
Anna Kyriakidou, Nikos Karelos, Alex Delis
PPOPP
2006
ACM
15 years 9 months ago
Fast and transparent recovery for continuous availability of cluster-based servers
Recently there has been renewed interest in building reliable servers that support continuous application operation. Besides maintaining system state consistent after a failure, o...
Rosalia Christodoulopoulou, Kaloian Manassiev, Ang...
CCGRID
2005
IEEE
15 years 8 months ago
A high performance configurable transport protocol for grid computing
− Grid computing infrastructures and applications are increasingly diverse, with networks ranging from very high bandwidth optical networks to wireless networks and applications ...
Xinran (Ryan) Wu, Andrew A. Chien, Matti A. Hiltun...