Sciweavers

1977 search results - page 80 / 396
» The satisfactory partition problem
Sort
View
ICML
2003
IEEE
16 years 6 months ago
Transductive Learning via Spectral Graph Partitioning
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
Thorsten Joachims
KDD
2003
ACM
210views Data Mining» more  KDD 2003»
16 years 6 months ago
Privacy-preserving k-means clustering over vertically partitioned data
Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. The key ...
Jaideep Vaidya, Chris Clifton
KDD
2002
ACM
214views Data Mining» more  KDD 2002»
16 years 6 months ago
Privacy preserving association rule mining in vertically partitioned data
Privacy considerations often constrain data mining projects. This paper addresses the problem of association rule mining where transactions are distributed across sources. Each si...
Jaideep Vaidya, Chris Clifton
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
16 years 6 months ago
Expander flows, geometric embeddings and graph partitioning
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
Sanjeev Arora, Satish Rao, Umesh V. Vazirani
ASPDAC
2006
ACM
117views Hardware» more  ASPDAC 2006»
16 years 14 hour ago
Signal-path driven partition and placement for analog circuit
This paper advances a new methodology based on signal-path information to resolve the problem of device-level placement for analog layout. This methodology is mainly based on three...
Di Long, Xianlong Hong, Sheqin Dong