Sciweavers

3341 search results - page 170 / 669
» On Bounded Queries and Approximation
Sort
View
ICDE
1999
IEEE
113views Database» more  ICDE 1999»
15 years 11 months ago
I/O Complexity for Range Queries on Region Data Stored Using an R-tree
In this paper we study the node distribution of an Rtree storing region data, like for instance islands, lakes or human-inhabited areas. We will show that real region datasets are...
Guido Proietti, Christos Faloutsos
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
15 years 7 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
JC
2000
45views more  JC 2000»
14 years 10 months ago
What Is the Complexity of Stieltjes Integration?
We study the complexity of approximating the Stieltjes integral R 1 0 f(x)dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded va...
Arthur G. Werschulz
SIGIR
1997
ACM
15 years 2 months ago
Learning Routing Queries in a Query Zone
Word usage is domain dependent. A common word in one domain can be quite infrequent in another. In this study we exploit this property of word usage to improve document routing. W...
Amit Singhal, Mandar Mitra, Chris Buckley
ICONIP
2004
14 years 11 months ago
Variational Information Maximization for Neural Coding
Abstract. Mutual Information (MI) is a long studied measure of coding efficiency, and many attempts to apply it to population coding have been made. However, this is a computationa...
Felix V. Agakov, David Barber