9842 search results - page 343 / 1969 » The Complexity of the Matching-Cut Problem |
125
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
A learning problem might have several measures of complexity (e.g., norm and dimensionality) that affect the generalization error. What is the interaction between these complexiti...
131
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
115
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study online learnability of a wide class of problems, extending the results of [26] to general notions of performance measure well beyond external regret. Our framework simult...
137
click to vote
JSW
2007
15 years 4 months ago
2007
— Active databases have been used in many different fields to accomplish many different tasks. One of the main problems today that still have not been solved is authorization. In...
121
click to vote
CAD
2002
Springer
15 years 3 months ago
2002
Springer
This paper presents a method for three-dimensional surface flattening, which can be efficiently used in threedimensional computer aided garment design. First, facet model is used ...