941 search results - page 56 / 189 » Efficient Testing of Large Graphs |
TRANSCI
2008
14 years 9 months ago
2008
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is sum of a congestion function and a disutility function. We pro...
ICMCS
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we investigate the applicability of different parts of the JPEG2000 codestream for authentication. Apart from the packet body different classes of information contai...
VIZSEC
2005
Springer
15 years 3 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
108
click to vote
COMGEO
2006
ACM
14 years 9 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
ASUNAM
2010
IEEE
14 years 10 months ago
2010
IEEE
—To understand the diffusive spreading of a product in a telecom network, whether the product is a service, handset, or subscription, it can be very useful to study the structure...