Sciweavers

2304 search results - page 90 / 461
» On the Vulnerability of Large Graphs
Sort
View
119
Voted
ESANN
2006
15 years 3 months ago
Visualizing gene interaction graphs with local multidimensional scaling
Several bioinformatics data sets are naturally represented as graphs, for instance gene regulation, metabolic pathways, and proteinprotein interactions. The graphs are often large ...
Jarkko Venna, Samuel Kaski
SODA
2000
ACM
121views Algorithms» more  SODA 2000»
15 years 2 months ago
Coloring powers of planar graphs
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
Geir Agnarsson, Magnús M. Halldórsso...
108
Voted
EJC
2010
15 years 1 months ago
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
Julia Böttcher, Klaas P. Pruessmann, Anusch T...
SSWMC
2004
15 years 2 months ago
Attacks on biometric systems: a case study in fingerprints
In spite of numerous advantages of biometrics-based personal authentication systems over traditional security systems based on token or knowledge, they are vulnerable to attacks t...
Umut Uludag, Anil K. Jain
TISSEC
2008
100views more  TISSEC 2008»
15 years 1 months ago
Message Dropping Attacks in Overlay Networks: Attack Detection and Attacker Identification
Overlay multicast networks are used by service providers to distribute contents such as web pages, streaming multimedia data, or security updates to a large number of users. Howeve...
Liang Xie, Sencun Zhu