Sciweavers

3341 search results - page 205 / 669
» On Bounded Queries and Approximation
Sort
View
SIGMOD
2006
ACM
107views Database» more  SIGMOD 2006»
16 years 6 months ago
Relaxed space bounding for moving objects: a case for the buddy tree
Rapid advancements in positioning systems and wireless communications enable accurate tracking of continuously moving objects. This development poses new challenges to database te...
Shuqiao Guo, Zhiyong Huang, H. V. Jagadish, Beng C...
FSE
2010
Springer
146views Cryptology» more  FSE 2010»
15 years 9 months ago
A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
Mridul Nandi
IJCAI
2007
15 years 7 months ago
Improving Author Coreference by Resource-Bounded Information Gathering from the Web
Accurate entity resolution is sometimes impossible simply due to insufficient information. For example, in research paper author name resolution, even clever use of venue, title ...
Pallika Kanani, Andrew McCallum, Chris Pal
JMLR
2002
140views more  JMLR 2002»
15 years 5 months ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
16 years 6 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller