446 search results - page 24 / 90 » Extremal Stable Graphs |
102
click to vote
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
This work proposes a graph mining based approach to mine a taxonomy of events from activities for complex videos which are represented in terms of qualitative spatio-temporal relat...
137
click to vote
WG
2010
Springer
15 years 7 days ago
2010
Springer
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
106
Voted
SIROCCO
2008
15 years 3 months ago
2008
Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state ...
112
click to vote
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
119
Voted
GD
2006
Springer
15 years 5 months ago
2006
Springer
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....