Sciweavers

1458 search results - page 106 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
IPPS
2003
IEEE
15 years 11 months ago
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...
IJCNN
2008
IEEE
16 years 16 days ago
Two-level clustering approach to training data instance selection: A case study for the steel industry
— Nowadays, huge amounts of information from different industrial processes are stored into databases and companies can improve their production efficiency by mining some new kn...
Heli Koskimäki, Ilmari Juutilainen, Perttu La...
INTERNET
2007
105views more  INTERNET 2007»
15 years 6 months ago
Workflow Planning on a Grid
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
Craig W. Thompson, Wing Ning Li, Zhichun Xiao
PPOPP
2010
ACM
16 years 3 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
ATAL
2009
Springer
16 years 21 days ago
Hedonic coalition nets
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
Edith Elkind, Michael Wooldridge