3471 search results - page 433 / 695 » Obstacle Numbers of Graphs |
230
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper addresses the challenge of recognizing behavior of groups of individuals in unconstraint surveillance environments. As opposed to approaches that rely on agglomerative ...
212
click to vote
TCC
2012
Springer
14 years 2 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
165
click to vote
DAC
2000
ACM
16 years 7 months ago
2000
ACM
Recently, intellectual property protection (IPP) techniques attracted a great deal of attention from semiconductor, system integration and software companies. A number of watermar...
218
Voted
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
200
click to vote
IPL
2010
15 years 1 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...