945 search results - page 73 / 189 » Graph Types |
JCO
2010
15 years 20 days ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
115
click to vote
TKDE
2008
15 years 2 months ago
2008
An important problem in the area of homeland security is to identify abnormal or suspicious entities in large datasets. Although there are methods from data mining and social netwo...
129
click to vote
COMPGEOM
1996
ACM
15 years 6 months ago
1996
ACM
We provideO(n)-timealgorithmsfor constructingthe following types of drawings of n-vertex 3-connectedplanar graphs: 2D convex grid drawings with (3n) (3n=2) area under the edge L1-...
133
click to vote
IJDAR
2006
15 years 2 months ago
2006
Evaluation of object detection algorithms is a non-trivial task: a detection result is usually evaluated by comparing the bounding box of the detected object with the bounding box...
136
click to vote
ICANN
2009
Springer
15 years 8 months ago
2009
Springer
Recently the notion of power law networks in the context of neural networks has gathered considerable attention. Some empirical results show that functional correlation networks in...