5606 search results - page 226 / 1122 » Randomization Techniques for Graphs. |
199
click to vote
AVI
2006
15 years 7 months ago
2006
Scientific measurements are often depicted as line graphs. Stateof-the-art high throughput systems in life sciences, telemetry and electronics measurement rapidly generate hundred...
165
click to vote
SOFSEM
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
152
click to vote
FCT
2005
Springer
15 years 12 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
242
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). An important component of an MRF-based approach is the i...
144
click to vote
ICDM
2007
IEEE
16 years 23 days ago
2007
IEEE
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...