1402 search results - page 199 / 281 » Searching Cycle-Disjoint Graphs |
ECIR
2004
Springer
14 years 11 months ago
2004
Springer
Abstract. This paper describes a novel interaction technique to support content-based image search in large image collections. The idea is to represent each image as a vertex in a ...
102
click to vote
ALENEX
2009
14 years 11 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
14 years 11 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
14 years 11 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
14 years 11 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...