Sciweavers

920 search results - page 74 / 184
» Computing the Frequency of Partial Orders
Sort
View
SIGGRAPH
1993
ACM
15 years 1 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
SIGGRAPH
2000
ACM
15 years 2 months ago
Adaptively sampled distance fields: a general representation of shape for computer graphics
Adaptively Sampled Distance Fields (ADFs) are a unifying representation of shape that integrate numerous concepts in computer graphics including the representation of geometry and...
Sarah F. Frisken Gibson, Ronald N. Perry, Alyn P. ...
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
15 years 3 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
GEOINFORMATICA
1998
107views more  GEOINFORMATICA 1998»
14 years 9 months ago
A Comparison of Two Approaches to Ranking Algorithms Used to Compute Hill Slopes
The calculation of slope (downhill gradient) for a point in a digital elevation model (DEM) is a common procedure in the hydrological, environmental and remote sensing sciences. T...
Kevin H. Jones
BICOB
2011
Springer
13 years 9 months ago
A Systematic Approach to Evaluate Sustained Stochastic Oscillations
Although the populations of biological systems are inherently discrete and their dynamics are strongly stochastic, it is usual to consider their limiting behaviour for large envir...
Jorge Júlvez, Marta Z. Kwiatkowska, Gethin ...