Sciweavers

551 search results - page 10 / 111
» The Complexity of Andersen's Analysis in Practice
Sort
View
KER
2008
134views more  KER 2008»
13 years 6 months ago
A review of current defeasible reasoning implementations
This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current stat...
Daniel Bryant, Paul J. Krause
COMPGEOM
2009
ACM
13 years 11 months ago
Visibility maps of realistic terrains have linear smoothed complexity
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
Mark de Berg, Herman J. Haverkort, Constantinos P....
ITICSE
2009
ACM
14 years 1 months ago
Software reuse and plagiarism: a code of practice
In general, university guidelines or policies on plagiarism are not sufficiently detailed to cope with the technical complexity of software. Software plagiarism can have a signiï¬...
J. Paul Gibson
SPIRE
2010
Springer
13 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
VVS
2000
IEEE
130views Visualization» more  VVS 2000»
13 years 11 months ago
A practical evaluation of popular volume rendering algorithms
This paper evaluates and compares four volume rendering algorithms that have become rather popular for rendering datasets described on uniform rectilinear grids: raycasting, splat...
Michael Meißner, Jian Huang, Dirk Bartz, Kla...