146 search results - page 14 / 30 » Boosting as a Metaphor for Algorithm Design |
RTCSA
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
77
Voted
SIGIR
2009
ACM
15 years 4 months ago
2009
ACM
When attempting to annotate music, it is important to consider both acoustic content and social context. This paper explores techniques for collecting and combining multiple sourc...
95
Voted
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
Current trends in technology scaling foreshadow worsening transistor reliability as well as greater numbers of transistors in each system. The combination of these factors will so...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
In patch-based object recognition, using a compact visual codebook can boost computational efficiency and reduce memory cost. Nevertheless, compared with a large-sized codebook, it...