90 search results - page 14 / 18 » Connectivity of Graphs Under Edge Flips |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
ICCV
2011
IEEE
12 years 7 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 ...
ICAI
2010
13 years 5 months ago
2010
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
— Many applications offer a form-based environment for na¨ıve users for accessing databases without being familiar with the database schema or a structured query language. User...