3208 search results - page 506 / 642 » A Lower Bound for Primality |
175
click to vote
MICAI
2005
Springer
15 years 12 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
165
click to vote
PDCAT
2005
Springer
15 years 12 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
155
click to vote
VMCAI
2005
Springer
15 years 12 months ago
2005
Springer
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
176
click to vote
WAOA
2005
Springer
15 years 12 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
149
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...