3142 search results - page 466 / 629 » Applied ontology issues |
183
click to vote
MDAI
2005
Springer
16 years 2 days ago
2005
Springer
Combining a set of classifiers has often been exploited to improve the classification performance. Accurate as well as diverse base classifiers are prerequisite to construct a good...
182
click to vote
MSN
2005
Springer
16 years 2 days ago
2005
Springer
The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the lifetime of...
161
click to vote
PAM
2005
Springer
16 years 2 days ago
2005
Springer
At present, link layer topology discovery methodologies rely on protocols that are not universally available, such as SNMP. Such methodologies can only be applied to a subset of al...
196
click to vote
SPIN
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. This paper presents a technique that uses code to automatically generate its own test cases at run-time by using a combination of symbolic and concrete (i.e., regular) ex...
175
click to vote
TCC
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...