16430 search results - page 826 / 3286 » On Computable Tree Functions |
185
click to vote
ICASSP
2008
IEEE
16 years 2 months ago
2008
IEEE
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
229
click to vote
SBRN
2008
IEEE
16 years 1 months ago
2008
IEEE
The design of an autonomous navigation system for mobile robots can be a tough task. Noisy sensors, unstructured environments and unpredictability are among the problems which mus...
198
click to vote
CSFW
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
230
click to vote
SACI
2007
IEEE
16 years 1 months ago
2007
IEEE
- The aim of this paper is to propose a filter, based on a multi-objective evolutionary algorithm, for attributes’ ranking in the context of a data mining task. The behavior of t...
187
click to vote
SEMWEB
2007
Springer
16 years 1 months ago
2007
Springer
The ability to compute the differences that exist between two RDF models is an important step to cope with the evolving nature of the Semantic Web (SW). In particular, RDF Deltas c...