Sciweavers

3341 search results - page 27 / 669
» On Bounded Queries and Approximation
Sort
View
ORL
2007
81views more  ORL 2007»
13 years 8 months ago
An improved probability bound for the Approximate S-Lemma
The purpose of this note is to give a probability bound on symmetric matrices to improve an error bound in the Approximate S-Lemma used in establishing levels of conservatism resu...
Kürsad Derinkuyu, Mustafa Ç. Pinar, Ah...
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 1 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
SAT
2007
Springer
99views Hardware» more  SAT 2007»
14 years 2 months ago
Horn Upper Bounds and Renaming
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
Marina Langlois, Robert H. Sloan, György Tur&...
ICMCS
2005
IEEE
132views Multimedia» more  ICMCS 2005»
14 years 2 months ago
Approximating the selectivity of multimedia range queries
This paper introduces a new approach of approximating the selectivity of multimedia range queries. Estimating the selectivity of a range query is a pre-requisite to optimize a mul...
Mario Döller, Harald Kosch