Sciweavers

1298 search results - page 119 / 260
» The online set cover problem
Sort
View
ICASSP
2008
IEEE
16 years 28 days 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
GLOBECOM
2009
IEEE
15 years 4 months ago
Joint Scheduling and Instantaneously Decodable Network Coding
We consider a wireless multi-hop network and design an algorithm for jointly optimal scheduling of packet transmissions and network coding. We consider network coding across differ...
Danail Traskov, Muriel Médard, Parastoo Sad...
CVPR
2011
IEEE
15 years 2 months ago
Adapting an Object Detector by Considering the Worst Case: a Conservative Approach
The performance of an offline-trained classifier can be improved on-site by adapting the classifier towards newly acquired data. However, the adaptation rate is a tuning parame...
Guang Chen, TonyX. Han
ICCD
2004
IEEE
113views Hardware» more  ICCD 2004»
16 years 3 months ago
End-to-End Testability Analysis and DfT Insertion for Mixed-Signal Paths
Increasing system complexity and test cost demands new system-level solutions for mixed-signal systems. In this paper, we present a testability analysis and DfT insertion methodol...
Sule Ozev, Alex Orailoglu
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
16 years 1 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...