1055 search results - page 103 / 211 » Enumerations in computable structure theory |
161
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
139
click to vote
TAGT
1994
Springer
15 years 8 months ago
1994
Springer
Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notat...
133
click to vote
MOMM
2009
ACM
15 years 9 months ago
2009
ACM
New directions in the provision of end-user computing experiences mean that we need to determine the best way to share data between small mobile computing devices. Partitioning la...
123
click to vote
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Effective fractal dimension was defined by Lutz (2003) in order to quantitatively analyze the structure of complexity classes. Interesting connections of effective dim...
114
click to vote
HT
2004
ACM
15 years 10 months ago
2004
ACM
In this paper we identify a common aim between ubiquitous computing and hypertext systems: the desire to present navigable, located and structured information. We propose that exi...