Sciweavers

1038 search results - page 120 / 208
» Space-Bounded Query Approximation
Sort
View
NIPS
2004
15 years 5 months ago
Analysis of a greedy active learning strategy
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
Sanjoy Dasgupta
SIGIR
2009
ACM
15 years 11 months ago
Good abandonment in mobile and PC internet search
Query abandonment by search engine users is generally considered to be a negative signal. In this paper, we explore the concept of good abandonment. We define a good abandonment ...
Jane Li, Scott B. Huffman, Akihito Tokuda
PODS
2004
ACM
148views Database» more  PODS 2004»
16 years 4 months ago
Deterministic Wavelet Thresholding for Maximum-Error Metrics
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
Minos N. Garofalakis, Amit Kumar
WINE
2007
Springer
151views Economy» more  WINE 2007»
15 years 10 months ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
15 years 5 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri