674 search results - page 90 / 135 » From Constructibility and Absoluteness to Computability and ... |
187
click to vote
FCT
2005
Springer
16 years 10 days ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
171
click to vote
EUROCRYPT
2006
Springer
15 years 10 months ago
2006
Springer
Motivated by the representation of biometric and multimedia objects, we consider the problem of hiding noisy point-sets using a secure sketch. A point-set X consists of s points fr...
178
click to vote
JAIR
2011
15 years 1 months ago
2011
Markovian processes have long been used to model stochastic environments. Reinforcement learning has emerged as a framework to solve sequential planning and decision-making proble...
170
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
153
click to vote
ECEASST
2008
15 years 6 months ago
2008
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...