Sciweavers

432 search results - page 77 / 87
» On Notions of Regularity for Data Languages
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Succinct Ordinal Trees Based on Tree Covering
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
Meng He, J. Ian Munro, S. Srinivasa Rao
FC
2005
Springer
142views Cryptology» more  FC 2005»
14 years 1 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
LCPC
2001
Springer
14 years 7 hour ago
Bridging the Gap between Compilation and Synthesis in the DEFACTO System
Abstract. The DEFACTO project - a Design Environment For Adaptive Computing TechnOlogy - is a system that maps computations, expressed in high-level languages such as C, directly o...
Pedro C. Diniz, Mary W. Hall, Joonseok Park, Byoun...
ECHT
1992
13 years 11 months ago
Hyperform: Using Extensibility to Develop Dynamic, Open and Distributed Hypertext Systems
An approach to exible hyperbase hypertext database support predicated on the notion of extensibility is presented. The extensible hypertext platform Hyperform implements basic hyp...
Uffe Kock Wiil, John J. Leggett
ICLP
2007
Springer
13 years 11 months ago
User-Definable Resource Bounds Analysis for Logic Programs
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
Jorge Navas, Edison Mera, Pedro López-Garc&...