874 search results - page 16 / 175 » Faster Algorithms for Semi-Matching Problems |
MICAI
2004
Springer
14 years 27 days ago
2004
Springer
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
IJCAI
2003
13 years 9 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Structured output prediction is an important machine learning problem both in theory and practice, and the max-margin Markov network (M3 N) is an effective approach. All state-of-...
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
In this paper we extend the study of flow-energy scheduling to a model that allows both sleep management and speed scaling. Our main result is a sleep management algorithm called I...