Sciweavers

830 search results - page 160 / 166
» An Evaluation Framework for Business Process Management Prod...
Sort
View
IMC
2004
ACM
14 years 23 days ago
Identifying elephant flows through periodically sampled packets
Identifying elephant flows is very important in developing effective and efficient traffic engineering schemes. In addition, obtaining the statistics of these flows is also ver...
Tatsuya Mori, Masato Uchida, Ryoichi Kawahara, Jia...
WIDM
2004
ACM
14 years 23 days ago
XPath lookup queries in P2P networks
We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the exte...
Angela Bonifati, Ugo Matrangolo, Alfredo Cuzzocrea...
KDD
2004
ACM
157views Data Mining» more  KDD 2004»
14 years 21 days ago
On detecting space-time clusters
Detection of space-time clusters is an important function in various domains (e.g., epidemiology and public health). The pioneering work on the spatial scan statistic is often use...
Vijay S. Iyengar
IPPS
2010
IEEE
13 years 5 months ago
Reconciling scratch space consumption, exposure, and volatility to achieve timely staging of job input data
Innovative scientific applications and emerging dense data sources are creating a data deluge for highend computing systems. Processing such large input data typically involves cop...
Henry M. Monti, Ali Raza Butt, Sudharshan S. Vazhk...
PPOPP
2009
ACM
14 years 8 months ago
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Tong Li, Dan P. Baumberger, Scott Hahn