Sciweavers

976 search results - page 98 / 196
» Evaluating Adversarial Partitions
Sort
View
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 9 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
VLDB
2003
ACM
123views Database» more  VLDB 2003»
14 years 9 months ago
A case for fractured mirrors
The Decomposition Storage Model (DSM) vertically partitions all attributes of a given relation. DSM has excellent I/O behavior when the number of attributes touched in the query i...
Ravishankar Ramamurthy, David J. DeWitt, Qi Su
EDBT
2004
ACM
163views Database» more  EDBT 2004»
14 years 9 months ago
Energy-Conserving Air Indexes for Nearest Neighbor Search
A location-based service (LBS) provides information based on the location information specified in a query. Nearest-neighbor (NN) search is an important class of queries supported ...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 6 months ago
On the Comparison of Relative Clustering Validity Criteria.
Many different relative clustering validity criteria exist that are very useful in practice as quantitative measures for evaluating the quality of data partitions, and new criter...
Lucas Vendramin, Ricardo J. G. B. Campello, Eduard...
HICSS
2009
IEEE
118views Biometrics» more  HICSS 2009»
14 years 3 months ago
Decentralized Reactive Power Dispatch for a Time-Varying Multi-TSO System
This paper addresses the problem of reactive power dispatch in a power system partitioned into several areas controlled by different transmission system operators. Previous resear...
Yannick Phulpin, Miroslav Begovic, Marc Petit, Dam...