Sciweavers

2409 search results - page 317 / 482
» Logical systems for structured specifications
Sort
View
SRDS
2005
IEEE
15 years 9 months ago
Distributed Construction of a Fault-Tolerant Network from a Tree
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
Michael K. Reiter, Asad Samar, Chenxi Wang
DAS
2004
Springer
15 years 9 months ago
Recognizing Freeform Digital Ink Annotations
Annotations on digital documents have clear advantages over annotations on paper. They can be archived, shared, searched, and easily manipulated. Freeform digital ink annotations a...
Michael Shilman, Zile Wei
GEOINFO
2003
15 years 5 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
AAI
2005
113views more  AAI 2005»
15 years 3 months ago
Analysis and Synthesis of Learning Agent's Communicative Behavior
This paper is about people. It is about understanding how learning and communication mutually influence one another; allowing people to infer each other's communicative behavi...
Nik Nailah Binti Abdullah, Stefano A. Cerri
CADE
2005
Springer
16 years 4 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard