Sciweavers

2822 search results - page 155 / 565
» Mining Optimized Ranges
Sort
View
JCAM
2010
139views more  JCAM 2010»
14 years 11 months ago
A finite difference method for free boundary problems
Fornberg and Meyer-Spasche proposed some time ago a simple strategy to correct finite difference schemes in the presence of a free boundary that cuts across a Cartesian grid. We sh...
Bengt Fornberg
DLOG
1998
15 years 5 months ago
Comparing Subsumption Optimizations
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
Ian Horrocks, Peter F. Patel-Schneider
GEOINFORMATICA
2006
94views more  GEOINFORMATICA 2006»
15 years 4 months ago
Spatial Query Estimation without the Local Uniformity Assumption
Existing estimation approaches for spatial databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, the...
Yufei Tao, Christos Faloutsos, Dimitris Papadias
IOR
2008
105views more  IOR 2008»
15 years 4 months ago
The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variat...
Grace Y. Lin, Yingdong Lu, David D. Yao
CC
2010
Springer
117views System Software» more  CC 2010»
15 years 11 months ago
Punctual Coalescing
Compilers use register coalescing to avoid generating code for copy instructions. For architectures with register aliasing such as x86, Smith, Ramsey, and Holloway (2004) presented...
Fernando Magno Quintão Pereira, Jens Palsbe...