Sciweavers

29908 search results - page 355 / 5982
» On the Complexity of
Sort
View
ALGOSENSORS
2004
Springer
16 years 6 days ago
On the Computational Complexity of Sensor Network Localization
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
James Aspnes, David Kiyoshi Goldenberg, Yang Richa...
CCS
2004
ACM
16 years 6 days ago
Concealing complex policies with hidden credentials
Hidden credentials are useful in protecting sensitive resource requests, resources, policies, and credentials. We propose a significant performance improvement when implementing ...
Robert W. Bradshaw, Jason E. Holt, Kent E. Seamons
EWCBR
2004
Springer
16 years 6 days ago
Explanation Service for Complex CBR Applications
Case-based Reasoning (CBR) is a mature technology for building knowledge-based systems that are capable to produce useful results even if no answer matches the query exactly. Often...
Rainer Maximini, Andrea Freßmann, Martin Sch...
IFIP
2004
Springer
16 years 5 days ago
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
ILP
2004
Springer
16 years 5 days ago
First Order Random Forests with Complex Aggregates
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
Celine Vens, Anneleen Van Assche, Hendrik Blockeel...