3204 search results - page 263 / 641 » The b-chromatic Number of a Graph |
81
Voted
CPM
2004
Springer
15 years 6 months ago
2004
Springer
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
118
click to vote
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
122
Voted
IPTPS
2003
Springer
15 years 6 months ago
2003
Springer
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...
94
Voted
GECCO
2000
Springer
15 years 4 months ago
2000
Springer
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
108
click to vote
ACL
2006
15 years 2 months ago
2006
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. I...