Sciweavers

3341 search results - page 101 / 669
» On Bounded Queries and Approximation
Sort
View
CIKM
2005
Springer
15 years 3 months ago
Towards estimating the number of distinct value combinations for a set of attributes
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
Xiaohui Yu, Calisto Zuzarte, Kenneth C. Sevcik
TKDE
2012
487views Formal Methods» more  TKDE 2012»
13 years 9 days ago
Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators
—Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of som...
Rajeev Gupta, Krithi Ramamritham
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
15 years 1 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
Jianer Chen, Iyad A. Kanj
JMLR
2010
132views more  JMLR 2010»
14 years 4 months ago
On the Impact of Kernel Approximation on Learning Accuracy
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...
Corinna Cortes, Mehryar Mohri, Ameet Talwalkar
HUC
2009
Springer
15 years 2 months ago
Privately querying location-based services with SybilQuery
To usefully query a location-based service, a mobile device must typically present its own location in its query to the server. This may not be acceptable to clients that wish to ...
Pravin Shankar, Vinod Ganapathy, Liviu Iftode