16430 search results - page 2603 / 3286 » On Computable Tree Functions |
235
click to vote
ILP
2004
Springer
16 years 25 days ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
215
click to vote
ISW
2004
Springer
16 years 25 days ago
2004
Springer
Abstract. Chameleon signatures are based on well established hashand-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest. Chameleon s...
174
click to vote
NOSSDAV
2004
Springer
16 years 25 days ago
2004
Springer
A large number of overlay multicast protocols have been developed, almost all of which assume universal connectivity between end hosts. However, in reality, this assumption is not...
215
click to vote
NPC
2004
Springer
16 years 25 days ago
2004
Springer
Massively parallel computing systems are being built with thousands of nodes. Because of the high number of components, it is critical to keep these systems running even in the pre...
196
click to vote
OTM
2004
Springer
16 years 25 days ago
2004
Springer
Exceptionally large amounts of both distributed data and computational resources are becoming available through the Grid. This will enable efficient exchange and processing of very...