1594 search results - page 94 / 319 » An Algorithm to Compute Collusion Paths |
147
click to vote
TCS
2010
15 years 1 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
156
click to vote
CLADE
2004
IEEE
15 years 6 months ago
2004
IEEE
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...
109
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we propose a new knowledge management task which aims to map Web pages to their corresponding records in a structured database. For example, the DBLP database contai...
130
click to vote
MOBIHOC
2004
ACM
16 years 2 months ago
2004
ACM
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
128
click to vote
PKC
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Traitor tracing schemes are cryptographically secure broadcast methods that allow identification of conspirators: if a pirate key is generated by k traitors out of a stat...