70 search results - page 11 / 14 » (U, N)-Implications and Their Characterizations |
COCO
2008
Springer
13 years 9 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
IPCO
2007
13 years 9 months ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
TCS
2008
13 years 7 months ago
2008
In this paper we study some classes of infinite words generalizing episturmian words, and analyse the relations occurring among such classes. In each case, the reversal operator R...
JGAA
2007
13 years 7 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider generic curves in R2 , i.e. generic C1 functions f : S1 R2 . We analyze these curves through the persistent homology groups of a filtration induced on S1 by f. In parti...