337 search results - page 15 / 68 » Computational complexity of weighted splitting schemes on pa... |
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
IMA
1995
Springer
13 years 11 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a new algorithm for color image quantization based on human color perception properties. We construct two kinds of map by analyzing the spatial color distributions to t...
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
Understanding how individual proteins are organized into complexes and pathways is a significant current challenge. We introduce new algorithms to infer protein complexes by combin...
ICPP
1992
IEEE
13 years 12 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...