903 search results - page 134 / 181 » Non-well-founded trees in categories |
127
click to vote
CASES
2006
ACM
15 years 8 months ago
2006
ACM
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
111
click to vote
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
127
click to vote
SAC
2006
ACM
15 years 7 months ago
2006
ACM
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
124
click to vote
VISUALIZATION
2005
IEEE
15 years 7 months ago
2005
IEEE
We propose a distributed data management scheme for large data visualization that emphasizes efficient data sharing and access. To minimize data access time and support users wit...
TLDI
2005
ACM
15 years 7 months ago
2005
ACM
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....