Sciweavers

575 search results - page 11 / 115
» A Spectral Approach to Lower Bounds
Sort
View
NIPS
2001
13 years 8 months ago
Spectral Relaxation for K-means Clustering
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming ...
ICML
2010
IEEE
13 years 8 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
TPDS
1998
95views more  TPDS 1998»
13 years 7 months ago
Bound Performance Models of Heterogeneous Parallel Processing Systems
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
Simonetta Balsamo, Lorenzo Donatiello, Nico M. van...
IWPEC
2009
Springer
14 years 1 months ago
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
Gregory Gutin, Eun Jung Kim, Stefan Szeider, Ander...
EUSFLAT
2007
154views Fuzzy Logic» more  EUSFLAT 2007»
13 years 8 months ago
Bounds for Value at Risk for Asymptotically Dependent Assets - the Copula Approach
The theory of copulas provides a useful tool for modeling dependence in risk management. In insurance and finance, as well as in other applications, dependence of extreme events ...
Piotr Jaworski