903 search results - page 9 / 181 » Non-well-founded trees in categories |
AAAI
2011
13 years 11 months ago
2011
Recognizing possibly thousands of objects is a crucial capability for an autonomous agent to understand and interact with everyday environments. Practical object recognition comes...
JACM
2000
14 years 11 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
110
click to vote
SIGMOD
2011
ACM
14 years 2 months ago
2011
ACM
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Agents programmed in BDI-inspired languages have goals to achieve and a library of plans that can be used to achieve them, typically requiring further goals to be adopted. This is...
JGTOOLS
2008
14 years 11 months ago
2008
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...