Sciweavers

3341 search results - page 22 / 669
» On Bounded Queries and Approximation
Sort
View
EDBT
2006
ACM
136views Database» more  EDBT 2006»
14 years 8 months ago
Optimizing Monitoring Queries over Distributed Data
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
Frank Neven, Dieter Van de Craen
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
14 years 3 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman
FOCS
2006
IEEE
14 years 2 months ago
On the Optimality of the Dimensionality Reduction Method
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
Alexandr Andoni, Piotr Indyk, Mihai Patrascu
VLDB
2001
ACM
129views Database» more  VLDB 2001»
14 years 27 days ago
Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
Yasushi Sakurai, Masatoshi Yoshikawa, Ryoji Kataok...
TIT
2008
123views more  TIT 2008»
13 years 8 months ago
Geometric Upper Bounds on Rates of Variable-Basis Approximation
In this paper, approximation by linear combinations of an increasing number n of computational units with adjustable parameters (such as perceptrons and radial basis functions) is ...
Vera Kurková, Marcello Sanguineti