2446 search results - page 112 / 490 » Choiceless Polynomial Time |
121
click to vote
IEEECGIV
2008
IEEE
15 years 10 months ago
2008
IEEE
In image processing, the curve comparisons can be achieved by extracting the curve information from the bitmapped images. The revealed curves are represented in the forms of the s...
104
click to vote
ARITH
2007
IEEE
15 years 10 months ago
2007
IEEE
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
139
click to vote
ICDM
2005
IEEE
15 years 9 months ago
2005
IEEE
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
168
click to vote
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
125
click to vote
CP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...