Sciweavers

588 search results - page 61 / 118
» Positive higher-order queries
Sort
View
ICGI
2010
Springer
15 years 5 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
Anna Kasprzik
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
15 years 4 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
RSA
2006
144views more  RSA 2006»
15 years 4 months ago
Data structures with dynamical random transitions
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
Clément Dombry, Nadine Guillotin-Plantard, ...
ORL
2010
156views more  ORL 2010»
14 years 11 months ago
Advertisement allocation for generalized second-pricing schemes
Recently, there has been a surge of interest in algorithms that allocate advertisement space in an online revenue-competitive manner. Most such algorithms, however, assume a pay-a...
Ashish Goel, Mohammad Mahdian, Hamid Nazerzadeh, A...
WWW
2011
ACM
14 years 11 months ago
Characterizing search intent diversity into click models
Modeling a user’s click-through behavior in click logs is a challenging task due to the well-known position bias problem. Recent advances in click models have adopted the examin...
Botao Hu, Yuchen Zhang, Weizhu Chen, Gang Wang, Qi...