4926 search results - page 182 / 986 » Two Graph Algorithms On an Associative Computing Model |
164
click to vote
FORMATS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...
159
click to vote
ICDAR
2007
IEEE
15 years 11 months ago
2007
IEEE
The Machine Learning and Pattern Recognition communities are facing two challenges: solving the normalization problem, and solving the deep learning problem. The normalization pro...
203
click to vote
SIROCCO
1997
15 years 6 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
183
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
136
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...