Sciweavers

158 search results - page 25 / 32
» Approximate Range Mode and Range Median Queries
Sort
View
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
13 years 10 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
CGF
2010
170views more  CGF 2010»
13 years 6 months ago
A Closed-Form Solution to Single Scattering for General Phase Functions and Light Distributions
Due to the intricate nature of the equation governing light transport in participating media, accurately and efficiently simulating radiative energy transfer remains very challeng...
Vincent Pegoraro, Mathias Schott, Steven G. Parker
VLDB
2012
ACM
360views Database» more  VLDB 2012»
12 years 2 months ago
An adaptive updating protocol for reducing moving object database workload
In the last decade, spatio-temporal database research focuses on the design of effective and efficient indexing structures in support of location-based queries such as predictive...
Su Chen, Beng Chin Ooi, Zhenjie Zhang
JMLR
2002
140views more  JMLR 2002»
13 years 6 months ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 4 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt