Sciweavers

250 search results - page 43 / 50
» Constructing a Class of Symmetric Graphs
Sort
View
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
14 years 3 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro
IWPC
2002
IEEE
14 years 2 months ago
Building Program Understanding Tools Using Visitor Combinators
Program understanding tools manipulate program represensuch as abstract syntax trees, control-flow graphs, or data-flow graphs. This paper deals with the use of visitor combinat...
Arie van Deursen, Joost Visser
DBPL
1993
Springer
95views Database» more  DBPL 1993»
14 years 1 months ago
A Moose and a Fox Can Aid Scientists with Data Management Problems
Fox Finding Objects of eXperiments is the declarative query language for Moose Modeling Objects Of Scienti c Experiments, an object-oriented data model at the core of a scient...
Janet L. Wiener, Yannis E. Ioannidis
CIKM
2010
Springer
13 years 8 months ago
MENTA: inducing multilingual taxonomies from wikipedia
In recent years, a number of projects have turned to Wikipedia to establish large-scale taxonomies that describe orders of magnitude more entities than traditional manually built ...
Gerard de Melo, Gerhard Weikum
JAL
1998
85views more  JAL 1998»
13 years 9 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay