Sciweavers

1855 search results - page 315 / 371
» Probabilistic Frame-Based Systems
Sort
View
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 10 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
SIGGRAPH
1993
ACM
15 years 10 months ago
Turbulent wind fields for gaseous phenomena
The realistic depiction of smoke, steam, mist and water reacting to a turbulent eld such as wind is an attractive and challenging problem. Its solution requires interlocking model...
Jos Stam, Eugene Fiume
ICALP
1990
Springer
15 years 10 months ago
Analytic Variations on the Common Subexpression Problem
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaer...
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 10 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
PODC
2010
ACM
15 years 10 months ago
Brief announcement: asynchronous bounded expected delay networks
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...