2304 search results - page 180 / 461 » On the Vulnerability of Large Graphs |
196
click to vote
ISCAS
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper addresses the problem of minimizing the clock period of a circuit by optimizingthe clock skews. We incorporate uncertainty factors and present a formulation that ensure...
212
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
174
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
146
click to vote
LCN
2007
IEEE
16 years 25 days ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
187
click to vote
ICCV
2005
IEEE
16 years 4 days ago
2005
IEEE
When an image is viewed at varying resolutions, it is known to create discrete perceptual jumps or transitions amid the continuous intensity changes. In this paper, we study a per...