4926 search results - page 88 / 986 » Two Graph Algorithms On an Associative Computing Model |
185
Voted
BDIM
2008
IEEE
15 years 9 months ago
2008
IEEE
—Knowing the dependencies among computing assets and services provides insights into the computing and business landscape, therefore, facilitating low-risk timely changes in supp...
111
Voted
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
117
click to vote
CVPR
2007
IEEE
15 years 8 months ago
2007
IEEE
We propose a framework for general multiple target tracking, where the input is a set of candidate regions in each frame, as obtained from a state of the art background learning, ...
129
click to vote
SAC
2000
ACM
15 years 6 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
108
Voted
FUIN
2007
15 years 2 months ago
2007
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many ...