Sciweavers

182 search results - page 28 / 37
» Approximate Colored Range Queries
Sort
View
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
14 years 2 days 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....
TOG
2008
293views more  TOG 2008»
13 years 8 months ago
A perceptually validated model for surface depth hallucination
Capturing detailed surface geometry currently requires specialized equipment such as laser range scanners, which despite their high accuracy, leave gaps in the surfaces that must ...
Mashhuda Glencross, Gregory J. Ward, Francho Melen...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 5 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
CGF
2010
170views more  CGF 2010»
13 years 8 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
COMCOM
2008
99views more  COMCOM 2008»
13 years 7 months ago
Reliability improvement for an RFID-based psychiatric patient localization system
Collaboration between Field Generators, Readers and Tags generates the required functions in using radio frequency identification (RFID) for psychiatric patient localization. The ...
Chieh-Ling Huang, Pau-Choo Chung, Ming-Hua Tsai, Y...