Sciweavers

1449 search results - page 191 / 290
» Finiteness results for sigmoidal
Sort
View
CGI
1998
IEEE
15 years 10 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
SIGCOMM
1996
ACM
15 years 10 months ago
On the Relevance of Long-Range Dependence in Network Traffic
There is much experimental evidence that network traffic processes exhibit ubiquitous properties of self-similarity and long-range dependence, i.e., of correlations over a wide ran...
Matthias Grossglauser, Jean-Chrysostome Bolot
CGI
2004
IEEE
15 years 10 months ago
Physically-Based Simulation of Objects Represented by Surface Meshes
Objects and scenes in virtual worlds such as 3-d computer games are typically represented by polygonal surface meshes. On the other hand, physically-based simulations of deformati...
Matthias Müller, Matthias Teschner, Markus H....
BIRTHDAY
2010
Springer
15 years 7 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
APAL
2010
115views more  APAL 2010»
15 years 6 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev