Sciweavers

1389 search results - page 199 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
16 years 3 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
AAAI
2007
15 years 5 months ago
Point-Based Policy Iteration
We describe a point-based policy iteration (PBPI) algorithm for infinite-horizon POMDPs. PBPI replaces the exact policy improvement step of Hansen’s policy iteration with point...
Shihao Ji, Ronald Parr, Hui Li, Xuejun Liao, Lawre...
WWW
2009
ACM
16 years 3 months ago
Advertising keyword generation using active learning
This paper proposes an efficient relevance feedback based interactive model for keyword generation in sponsored search advertising. We formulate the ranking of relevant terms as a...
Hao Wu, Guang Qiu, Xiaofei He, Yuan Shi, Mingcheng...
ICASSP
2008
IEEE
15 years 9 months ago
Music preference learning with partial information
We consider the problem of online learning in a changing environment under sparse user feedback. Specifically, we address the classification of music types according to a user...
Yvonne Moh, Peter Orbanz, Joachim M. Buhmann
DAC
1996
ACM
15 years 7 months ago
Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
Eric Verlind, Gjalt G. de Jong, Bill Lin