Sciweavers

253 search results - page 36 / 51
» Perfection thickness of graphs
Sort
View
TDSC
2008
83views more  TDSC 2008»
13 years 7 months ago
A Precise Termination Condition of the Probabilistic Packet Marking Algorithm
The probabilistic packet marking (PPM) algorithm is a promising way to discover the Internet map or an attack graph that the attack packets traversed during a distributed denial-of...
T. Y. Wong, Man Hon Wong, John C. S. Lui
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
14 years 4 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
FOCS
2005
IEEE
14 years 1 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira
COCOON
2008
Springer
13 years 9 months ago
Visual Cryptography on Graphs
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node an...
Steve Lu, Daniel Manchala, Rafail Ostrovsky
JMM2
2007
127views more  JMM2 2007»
13 years 7 months ago
Robust Face Recognition through Local Graph Matching
— A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometr...
Ehsan Fazl Ersi, John S. Zelek, John K. Tsotsos