933 search results - page 130 / 187 » Monotone Complexity of a Pair |
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
SMA
2009
ACM
14 years 3 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...