2304 search results - page 146 / 461 » On the Vulnerability of Large Graphs |
186
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
184
click to vote
TCS
2012
14 years 1 months ago
2012
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...
181
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
174
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
162
click to vote
3DPVT
2006
IEEE
16 years 9 days ago
2006
IEEE
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....