246 search results - page 21 / 50 » Bichain graphs: Geometric model and universal graphs |
PAMI
2010
14 years 8 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
CORR
1999
Springer
14 years 9 months ago
1999
Springer
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
88
Voted
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
114
click to vote
EJC
2011
14 years 4 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...