427 search results - page 35 / 86 » Computing the Local Consensus of Trees |
166
Voted
LICS
2010
IEEE
15 years 3 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
275
click to vote
CVIU
2011
15 years 1 days ago
2011
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
116
click to vote
DRM
2007
Springer
15 years 11 months ago
2007
Springer
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
183
Voted
CVPR
2011
IEEE
15 years 14 days ago
2011
IEEE
We present novel approaches for fully automated extraction of tree-like tubular structures from 3-D image stacks. A 4-D Open-Curve Active Contour (Snake) model is proposed for sim...
220
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...