Sciweavers

3341 search results - page 239 / 669
» On Bounded Queries and Approximation
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
15 years 6 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
CGF
1998
118views more  CGF 1998»
15 years 6 months ago
An Exhaustive Error-Bounding Algorithm for Hierarchical Radiosity
This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial appli...
Nicolas Holzschuch, François X. Sillion
JC
2011
87views more  JC 2011»
15 years 1 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
WOLLIC
2009
Springer
16 years 1 months ago
Query Answering in Description Logics: The Knots Approach
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...
Thomas Eiter, Carsten Lutz, Magdalena Ortiz, Manta...
DEXA
1998
Springer
124views Database» more  DEXA 1998»
15 years 11 months ago
Indexing Time-Series Databases for Inverse Queries
Abstract. In this paper we examine the problem of indexing time sequences in order to answer inverse queries. An inverse query computes all the time points at which the sequence co...
Alexandros Nanopoulos, Yannis Manolopoulos