11565 search results - page 2030 / 2313 » Computing Minimal Mappings |
165
click to vote
NOCS
2007
IEEE
16 years 29 days ago
2007
IEEE
Abstract – With the rise of multicore computing, the design of onchip networks (or networks on chip) has become an increasingly important component of computer architecture. The ...
193
click to vote
STACS
2007
Springer
16 years 24 days ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
214
click to vote
ICDCS
2006
IEEE
16 years 22 days ago
2006
IEEE
Distributed storage systems employ replicas or erasure code to ensure high reliability and availability of data. Such replicas create great amount of network traffic that negative...
205
click to vote
ICDCS
2006
IEEE
16 years 22 days ago
2006
IEEE
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
177
click to vote
ISCAS
2005
IEEE
16 years 8 days ago
2005
IEEE
The H.264 adopts various block types and multiple reference frames for motion compensation. For transcoding a video sequence from the H.263 format to the H.264 format, it is benef...