674 search results - page 33 / 135 » From Constructibility and Absoluteness to Computability and ... |
TLCA
2007
Springer
15 years 8 months ago
2007
Springer
In our previous work [17] we have shown that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary. This ac...
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
The problem of finding the most appropriate subset of features or regressors is the generic challenge of Machine Learning problems like regression estimation or pattern recognitio...
142
click to vote
DILS
2010
Springer
15 years 3 months ago
2010
Springer
Search computing has been proposed to support the integration of the results of search engines with other data and computational resources. In essence, in search computing, search ...
120
click to vote
IJSI
2008
15 years 1 months ago
2008
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
173
click to vote
ASIACRYPT
2008
Springer
15 years 3 months ago
2008
Springer
Recently Cash, Kiltz, and Shoup [20] showed a variant of the Cramer-Shoup (CS) public key encryption (PKE) scheme [21] whose chosen-ciphertext (CCA) security relies on the computa...