Sciweavers

3735 search results - page 547 / 747
» Order compression schemes
Sort
View
COMGEO
2007
ACM
15 years 5 months ago
An intersection-sensitive algorithm for snap rounding
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running ...
Mark de Berg, Dan Halperin, Mark H. Overmars
IS
2006
15 years 5 months ago
Incremental maintenance of aggregate and outerjoin expressions
Views stored in a data warehouse need to be kept current. As recomputing the views is very expensive, incremental maintenance algorithms are required. Over recent years, several i...
Himanshu Gupta, Inderpal Singh Mumick
CPHYSICS
2007
51views more  CPHYSICS 2007»
15 years 5 months ago
Shearingbox-implementation for the central-upwind, constraint-transport MHD-code NIRVANA
We describe the implementation of the shearingbox approach into the Godunovtype central-upwind/constraint-transport magnetohydrodynamics code NIRVANA. This will allow for applicat...
O. Gressel, U. Ziegler
JMLR
2006
123views more  JMLR 2006»
15 years 5 months ago
Adaptive Prototype Learning Algorithms: Theoretical and Experimental Studies
In this paper, we propose a number of adaptive prototype learning (APL) algorithms. They employ the same algorithmic scheme to determine the number and location of prototypes, but...
Fu Chang, Chin-Chin Lin, Chi-Jen Lu
EOR
2007
87views more  EOR 2007»
15 years 5 months ago
The TV-Break Packing Problem
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
Thierry Benoist, Eric Bourreau, Benoît Rotte...