2304 search results - page 283 / 461 » On the Vulnerability of Large Graphs |
188
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
202
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
145
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
While many clever techniques have been proposed for visual analysis, most of these are “one of” and it is not easy to see how to combine multiple techniques. We propose an alg...
211
click to vote
ICRA
2007
IEEE
16 years 27 days ago
2007
IEEE
Abstract— This paper presents a solution to interactive navigation planning and real-time simulation of a very large number of entities moving in a virtual environment. From the ...
155
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...