Sciweavers

6142 search results - page 482 / 1229
» The Complexity of Partition Functions
Sort
View
WWW
2008
ACM
16 years 7 months ago
Efficiently finding web services using a clustering semantic approach
Efficiently finding Web services on the Web is a challenging issue in service-oriented computing. Currently, UDDI is a standard for publishing and discovery of Web services, and U...
Jiangang Ma, Yanchun Zhang, Jing He
CHI
2005
ACM
16 years 7 months ago
What's in your wallet?: implications for global e-wallet design
As part of a comparative ethnographic study of everyday life of young professionals in London, Los Angeles, and Tokyo, we conducted a detailed survey of wallets and their contents...
Scott D. Mainwaring, Ken Anderson, Michele F. Chan...
HPCA
2006
IEEE
16 years 7 months ago
High performance file I/O for the Blue Gene/L supercomputer
Parallel I/O plays a crucial role for most data-intensive applications running on massively parallel systems like Blue Gene/L that provides the promise of delivering enormous comp...
Hao Yu, Ramendra K. Sahoo, C. Howson, G. Almasi, J...
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
16 years 7 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
PODS
2005
ACM
115views Database» more  PODS 2005»
16 years 7 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...