721 search results - page 54 / 145 » Almost universal graphs |
103
click to vote
DM
2010
14 years 12 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
104
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
Closing the semantic gap in content based image retrieval (CBIR) basically requires the knowledge of the user's intention which is usually translated into a sequence of quest...
101
click to vote
LION
2009
Springer
15 years 6 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
100
click to vote
WG
1993
Springer
15 years 4 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
109
click to vote
CCCG
2010
15 years 1 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...