412 search results - page 52 / 83 » A New Proof of the F5 Algorithm |
ATVA
2006
Springer
15 years 1 months ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
WSC
2007
15 years 5 days ago
2007
The problem of finding the binomial population with the highest success probability is considered when the number of binomial populations is large. A new rigorous indifference zo...
CC
2008
Springer
14 years 10 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
MICCAI
2007
Springer
15 years 10 months ago
2007
Springer
In cancer treatment, understanding the aggressiveness of the tumor is essential in therapy planning and patient follow-up. In this article, we present a novel method for quantifyin...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Bulk Synchronous Parallel ML (BSML) is an extension of the functional language Objective Caml to program Bulk Synchronous Parallel (BSP) algorithms. It is deterministic, deadlock ...