2304 search results - page 344 / 461 » On the Vulnerability of Large Graphs |
163
click to vote
IJDSN
2008
15 years 5 months ago
2008
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
145
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...
179
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
164
click to vote
CAP
2010
15 years 1 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
158
click to vote
TGIS
2010
15 years 27 days ago
2010
The presented paper deals with a generic process for road network selection based on data enrichment and structure detection. The first step is to detect significant structures and...