318 search results - page 24 / 64 » Real Number Computability and Domain Theory |
133
click to vote
ICPR
2000
IEEE
16 years 5 months ago
2000
IEEE
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
137
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
118
click to vote
ECSQARU
1997
Springer
15 years 8 months ago
1997
Springer
We develop a classification method for incoming pieces of evidence in Dempster-Shafer theory. This methodology is based on previous work with clustering and specification of origin...
164
click to vote
DCC
1995
IEEE
15 years 8 months ago
1995
IEEE
: In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried o...
146
click to vote
SEMWEB
2009
Springer
15 years 11 months ago
2009
Springer
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...