2333 search results - page 182 / 467 » Recursive Computational Depth |
111
Voted
ICMLA
2008
15 years 3 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
108
Voted
DBSEC
2008
15 years 3 months ago
2008
Abstract. When generalization algorithms are known to the public, an adversary can obtain a more precise estimation of the secret table than what can be deduced from the disclosed ...
102
click to vote
INFORMATICALT
2000
15 years 2 months ago
2000
In the previous paper (Pupeikis, 2000) the problem of closed-loop robust identification using the direct approach in the presence of outliers in observations have been considered. ...
113
Voted
AML
1999
15 years 2 months ago
1999
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
140
click to vote
SPC
2005
Springer
15 years 8 months ago
2005
Springer
We develop the theme of an earlier paper [3], namely that security protocols for pervasive computing frequently need to exploit empirical channels and that the latter can be classi...