3105 search results - page 414 / 621 » The Path-Packing Structure of Graphs |
163
click to vote
WWW
2003
ACM
16 years 4 months ago
2003
ACM
Recent advances in information retrieval over hyperlinked corpora have convincinglydemonstratedthat links carry less noisy information than text. We investigate the feasibility of...
128
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
128
click to vote
RECOMB
2010
Springer
15 years 11 months ago
2010
Springer
Constructing quantitative dynamic models of signaling pathways is an important task for computational systems biology. Pathway model construction is often an inherently incremental...
146
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
143
click to vote
SEMWEB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Similarity has become a classical tool for ontology confrontation motivated by alignment, mapping or merging purposes. In the definition of an ontologybased measure one ...