4934 search results - page 427 / 987 » complexity 2008 |
244
click to vote
ECCV
2008
Springer
16 years 9 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
357
click to vote
ICDE
2008
IEEE
16 years 9 months ago
2008
IEEE
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
208
click to vote
DAC
2008
ACM
16 years 8 months ago
2008
ACM
In this paper, a novel automatic approach for the concurrent topology and routing optimization that achieves a high quality network layout is proposed. This optimization is based ...
173
click to vote
CHI
2008
ACM
16 years 8 months ago
2008
ACM
The focus of this work is the requirements engineering process in the home care domain. The overall aim is to design and document a flexible methodology to facilitate the elicitat...
168
click to vote
HPCA
2008
IEEE
16 years 8 months ago
2008
IEEE
Serializing instructions (SIs), such as writes to control registers, have many complex dependencies, and are difficult to execute out-of-order (OoO). To avoid unnecessary complexi...