1951 search results - page 249 / 391 » An algorithm for improving graph partitions |
133
click to vote
DCC
2005
IEEE
16 years 4 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
154
Voted
GECCO
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and...
154
click to vote
IWOCA
2009
Springer
15 years 11 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
129
click to vote
ASPLOS
2006
ACM
15 years 11 months ago
2006
ACM
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed mi...
151
Voted
DCOSS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...