2304 search results - page 164 / 461 » On the Vulnerability of Large Graphs |
195
click to vote
EURODAC
1995
IEEE
15 years 10 months ago
1995
IEEE
Distributed systems are becoming a popular way of implementing many embedded computing applications, automotive control being a common and important example. Such embedded systems...
194
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
-- In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless ad hoc networks. As it is vulnerable to a sin...
169
click to vote
FASE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, e...
234
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
164
click to vote
CIVR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We propose a graph based method to improve the performance of person queries in large news video collections. The method benefits from the multi-modal structure of videos...