13987 search results - page 117 / 2798 » The Two Guards Problem |
155
click to vote
CP
2011
Springer
14 years 3 months ago
2011
Springer
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
148
click to vote
ICA
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we consider independence property between a random process and its first derivative. Then, for linear mixtures, we show that cross-correlations between mixtures and...
146
click to vote
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
123
Voted
TJS
2002
15 years 3 months ago
2002
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
143
click to vote
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...