2531 search results - page 127 / 507 » Group testing in graphs |
140
click to vote
ESA
2003
Springer
15 years 6 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
104
click to vote
ACSAC
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, we present techniques for a network forensics analysis mechanism that includes effective evidence presentation, manipulation and automated reasoning. We propose the...
97
Voted
CORR
2008
Springer
15 years 28 days ago
2008
Springer
Given a query on the PASCAL database maintained by the INIST, we design user interfaces to visualize and wo types of graphs extracted from abstracts: 1) the graph of all associati...
110
Voted
ENDM
2008
15 years 28 days ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
107
Voted
CIVR
2010
Springer
15 years 5 months ago
2010
Springer
Graphical passwords have been demonstrated to be the possible alternatives to traditional alphanumeric passwords. However, they still tend to follow predictable patterns that are ...