Sciweavers

2272 search results - page 100 / 455
» Capture Complexity by Partition
Sort
View
ICSOC
2005
Springer
15 years 3 months ago
Handling Faults in Decentralized Orchestration of Composite Web Services
Abstract. Composite web services can be orchestrated in a decentralized manner by breaking down the original service specification into a set of partitions and executing them on a...
Girish Chafle, Sunil Chandra, Pankaj Kankar, Vijay...
ICDM
2003
IEEE
104views Data Mining» more  ICDM 2003»
15 years 3 months ago
Localized Prediction of Continuous Target Variables Using Hierarchical Clustering
In this paper, we propose a novel technique for the efficient prediction of multiple continuous target variables from high-dimensional and heterogeneous data sets using a hierarch...
Aleksandar Lazarevic, Ramdev Kanapady, Chandrika K...
COLT
2003
Springer
15 years 3 months ago
Learning with Equivalence Constraints and the Relation to Multiclass Learning
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
Aharon Bar-Hillel, Daphna Weinshall
EUROPAR
2004
Springer
15 years 1 months ago
Efficient Parallel Hierarchical Clustering
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...
DAWAK
2008
Springer
14 years 11 months ago
Efficient Data Distribution for DWS
The DWS (Data Warehouse Striping) technique is a data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables are distribute...
Raquel Almeida, Jorge Vieira, Marco Vieira, Henriq...