4171 search results - page 805 / 835 » Choice numbers of graphs |
108
click to vote
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
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}â...
111
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
121
click to vote
RECOMB
2007
Springer
15 years 5 months ago
2007
Springer
Publicly-available data sets provide detailed and large-scale information on multiple types of molecular interaction networks in a number of model organisms. These multi-modal univ...
SEMWEB
2007
Springer
15 years 5 months ago
2007
Springer
In this paper, we present the AgreementMaker, an ontology alignment tool that incorporates the Descendants Similarity Inheritance (DSI) method. This method uses the structure of th...
VLDB
2007
ACM
15 years 5 months ago
2007
ACM
In this paper, we describe the challenges of prototyping a reference application on System S, a distributed stream processing middleware under development at IBM Research. With a ...