4767 search results - page 644 / 954 » Structures for Abstract Rewriting |
186
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, pa...
188
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
217
click to vote
ER
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Data in many industrial application systems are often neither completely structured nor unstructured. Consequently semi-structured data models such as XML have become pop...
179
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
191
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Abstract. Enhanced RFID tag technology especially in the UHF frequency range provides extended functionality like high operating range and sensing and monitoring capabilities. Such...