Sciweavers

1933 search results - page 38 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
120
Voted
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
15 years 9 months ago
Improved Combinatorial Group Testing for Real-World Problem Sizes
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which i...
David Eppstein, Michael T. Goodrich, Daniel S. Hir...
104
Voted
ICASSP
2008
IEEE
15 years 10 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
135
Voted
CIKM
2003
Springer
15 years 8 months ago
Tracking changes in user interests with a few relevance judgments
Keeping track of changes in user interests from a document stream with a few relevance judgments is not an easy task. To tackle this problem, we propose a novel method that integr...
Dwi H. Widyantoro, Thomas R. Ioerger, John Yen
105
Voted
FOCS
2009
IEEE
15 years 10 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
167
Voted
CORR
2011
Springer
196views Education» more  CORR 2011»
14 years 7 months ago
Privacy-Enhanced Reputation-Feedback Methods to Reduce Feedback Extortion in Online Auctions
In this paper, we study methods for improving the utility and privacy of reputation scores for online auctions, such as used in eBay, so as to reduce the effectiveness of feedbac...
Michael T. Goodrich, Florian Kerschbaum