16430 search results - page 289 / 3286 » On Computable Tree Functions |
161
click to vote
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
124
click to vote
JSYML
2008
15 years 4 months ago
2008
In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A T 0 is nonlow2 if and only if A is prime bounding, i.e. for every complete atomic decidable theory T , there i...
171
click to vote
UC
2009
Springer
15 years 11 months ago
2009
Springer
We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of alia...
143
click to vote
HIPC
2007
Springer
15 years 11 months ago
2007
Springer
This paper presents our work in combining peer-to-peer dynamic tree management with hierarchical Operational Transformation (OT) over document trees to achieve low computational an...
120
click to vote
ICPR
2000
IEEE
16 years 5 months ago
2000
IEEE
Tree structured belief networks are attractive for image segmentation tasks. However, networks with fixed architectures are not very suitable as they lead to blocky arte