417 search results - page 20 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
EJC
2007
13 years 8 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
COCOON
2006
Springer
14 years 5 days ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
TACAS
2009
Springer
14 years 3 months ago
2009
Springer
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...