1983 search results - page 365 / 397 » Competitive graph searches |
ALENEX
2009
13 years 8 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
ICMCS
2010
IEEE
13 years 8 months ago
2010
IEEE
Labeling persons appearing in video frames with names detected from the video transcript helps improving the video content identification and search task. We develop a face naming...