2131 search results - page 270 / 427 » Immunity for Closed Sets |
150
click to vote
MFCS
2005
Springer
16 years 11 hour ago
2005
Springer
A partial information algorithm for a language A computes, for some fixed m, for input words x1, . . . , xm a set of bitstrings containing χA(x1, . . . , xm). E.g., p-selective, ...
173
click to vote
MICAI
2005
Springer
16 years 11 hour ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
164
click to vote
SSD
2005
Springer
16 years 24 min ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
188
click to vote
SSD
2005
Springer
16 years 23 min ago
2005
Springer
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
150
click to vote
TCC
2005
Springer
15 years 12 months ago
2005
Springer
The existing unconditional security definitions of quantum key distribution (QKD) do not apply to joint attacks over QKD and the subsequent use of the resulting key. In this paper...