Sciweavers

1632 search results - page 159 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
WSCG
2004
143views more  WSCG 2004»
15 years 5 months ago
View Dependent Stochastic Sampling for Efficient Rendering of Point Sampled Surfaces
In this paper we present a new technique for rendering very large datasets representing point-sampled surfaces. Rendering efficiency is considerably improved by using stochastic s...
Sushil Bhakar, Liang Luo, Sudhir P. Mudur
JPDC
2007
138views more  JPDC 2007»
15 years 3 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
DEXA
2008
Springer
120views Database» more  DEXA 2008»
15 years 5 months ago
Compressing Very Large Database Workloads for Continuous Online Index Selection
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of ...
Piotr Kolaczkowski
ISWC
2000
IEEE
15 years 8 months ago
Finding Location Using Omnidirectional Video on a Wearable Computing Platform
In this paper we present a framework for a navigation system in an indoor environment using only omnidirectional video. Within a Bayesian framework we seek the appropriate place a...
Wasinee Rungsarityotin, Thad Starner
CACM
2010
104views more  CACM 2010»
15 years 4 months ago
Faster dimension reduction
Data represented geometrically in high-dimensional vector spaces can be found in many applications. Images and videos, are often represented by assigning a dimension for every pix...
Nir Ailon, Bernard Chazelle