777 search results - page 29 / 156 » The Refined Process Structure Tree |
117
Voted
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
108
click to vote
ACL
2001
15 years 5 months ago
2001
While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures o...
104
click to vote
APAL
2007
15 years 3 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
234
click to vote
ICDE
2002
IEEE
16 years 4 months ago
2002
IEEE
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
128
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...