Sciweavers

1957 search results - page 9 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
WINE
2007
Springer
112views Economy» more  WINE 2007»
15 years 3 months ago
Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm
We consider a crucial aspect of displaying advertisements on the internet: the individual user. In particular, we consider ad fatigue, where a user tires of an advertisement as it ...
Zoë Abrams, Erik Vee
DAM
2008
111views more  DAM 2008»
14 years 9 months ago
Sums of squares based approximation algorithms for MAX-SAT
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
Hans van Maaren, Linda van Norden, M. J. H. Heule
ICDE
2012
IEEE
252views Database» more  ICDE 2012»
13 years 1 days ago
Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
Chong Sun, Jeffrey F. Naughton, Siddharth Barman
NIPS
1998
14 years 11 months ago
A Phase Space Approach to Minimax Entropy Learning and the Minutemax Approximations
There has been much recent work on measuring image statistics and on learning probability distributions on images. We observe that the mapping from images to statistics is many-to...
James M. Coughlan, Alan L. Yuille
FOCS
2008
IEEE
15 years 4 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder