1418 search results - page 129 / 284 » Schema polynomials and applications |
158
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
171
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
180
click to vote
TCC
2004
Springer
15 years 11 months ago
2004
Springer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
175
click to vote
SAC
2008
ACM
15 years 5 months ago
2008
ACM
For short-term forecasting of wind generation, a necessary step is to model the function for the conversion of meteorological variables (mainly wind speed) to power production. Su...
202
click to vote
TCBB
2010
2010
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
15 years 1 months ago
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...