2304 search results - page 175 / 461 » On the Vulnerability of Large Graphs |
176
click to vote
ICML
2004
IEEE
15 years 12 months ago
2004
IEEE
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
204
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
We study the problem of event detection from realistic videos with repetitive sequential human activities. Despite the large body of work on event detection and recognition, very ...
166
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
152
click to vote
EJC
2007
15 years 6 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...
111
click to vote
HT
1997
ACM
15 years 10 months ago
1997
ACM
A large hypertext net with node-to-node links can be interesting as a system of unities of meaning formed by node clusters, such that nodes in each of them are orderable into a co...