Sciweavers

272 search results - page 40 / 55
» Lazy tree splitting
Sort
View
CIKM
2005
Springer
13 years 9 months ago
Handling frequent updates of moving objects
A critical issue in moving object databases is to develop appropriate indexing structures for continuously moving object locations so that queries can still be performed efficien...
Bin Lin, Jianwen Su
MST
2007
168views more  MST 2007»
13 years 7 months ago
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Milad Niqui
JMLR
2010
107views more  JMLR 2010»
13 years 2 months ago
Learning Instance-Specific Predictive Models
This paper introduces a Bayesian algorithm for constructing predictive models from data that are optimized to predict a target variable well for a particular instance. This algori...
Shyam Visweswaran, Gregory F. Cooper
ICDCS
2009
IEEE
14 years 4 months ago
m-LIGHT: Indexing Multi-Dimensional Data over DHTs
In this paper, we study the problem of indexing multidimensional data in the P2P networks based on distributed hash tables (DHTs). We identify several design issues and propose a ...
Yuzhe Tang, Jianliang Xu, Shuigeng Zhou, Wang-Chie...
EGH
2004
Springer
13 years 11 months ago
Efficient partitioning of fragment shaders for multiple-output hardware
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
Tim Foley, Mike Houston, Pat Hanrahan