Sciweavers

324 search results - page 21 / 65
» Two-way Replacement Selection
Sort
View
WSCG
2001
98views more  WSCG 2001»
13 years 8 months ago
Geometric Simplification for Efficient Occlusion Culling in Urban Scenes
Most occlusion culling algorithms select a subset of suitable occluder planes or geometries to exclude invisible objects from further visualization processing. Preferably these oc...
Rick Germs, Frederik W. Jansen
CORR
2004
Springer
97views Education» more  CORR 2004»
13 years 7 months ago
The semijoin algebra and the guarded fragment
In the 1970s Codd introduced the relational algebra, with operators selection, projection, union, difference and product, and showed that it is equivalent to first-order logic. In ...
Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Buss...
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
13 years 11 months ago
Code Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
Keith E. Mathias, Larry J. Eshelman, J. David Scha...
BPM
2008
Springer
136views Business» more  BPM 2008»
13 years 9 months ago
On the Formal Generation of Process Redesigns
Business Process Redesign (BPR) is a process oriented methodology to improve organizations. Although literature on BPR is available in abundance, little concrete support on how to ...
Mariska Netjes, Hajo A. Reijers, Wil M. P. van der...
ESANN
2004
13 years 8 months ago
Sparse Bayesian kernel logistic regression
In this paper we present a simple hierarchical Bayesian treatment of the sparse kernel logistic regression (KLR) model based MacKay's evidence approximation. The model is re-p...
Gavin C. Cawley, Nicola L. C. Talbot