Sciweavers

1977 search results - page 106 / 396
» The satisfactory partition problem
Sort
View
182
Voted
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 7 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
ICMLC
2010
Springer
15 years 4 months ago
An integrity-based fuzzy c-means method resolving cluster size sensitivity problem
: Cluster size insensitive FCM (csiFCM) dynamically adjusts the membership value of each object based on the size of the cluster to which it is assigned after defuzzification to re...
Y. H. Lai, P. W. Huang, P. L. Lin
185
Voted
DRM
2006
Springer
15 years 9 months ago
The problem with rights expression languages
In this paper we consider the functionality that a rights expression language (REL) should provide within a digital rights management (DRM) environment. We begin by noting the dea...
Pramod A. Jamkhedkar, Gregory L. Heileman, Iv&aacu...
JMLR
2006
108views more  JMLR 2006»
15 years 6 months ago
Learning Spectral Clustering, With Application To Speech Separation
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
Francis R. Bach, Michael I. Jordan
189
Voted
MICS
2008
124views more  MICS 2008»
15 years 4 months ago
Community Structures of Networks
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
William Y. C. Chen, Andreas W. M. Dress, Winking Q...