Sciweavers

4095 search results - page 315 / 819
» How to test a tree
Sort
View
ICNP
1998
IEEE
15 years 5 months ago
Receiver-based Multicast Scoping: A New Cost-Conscious Join/Leave Paradigm
In Internet multicast, the set of receivers can be dynamic with receivers joining and leaving a group asynchronously and without the knowledge of the sources. The Internet today u...
George F. Riley, Mostafa H. Ammar, Lenitra M. Clay
78
Voted
AIMSA
1990
Springer
15 years 4 months ago
Compilation of Recursive Two-Literal Clauses into Unification Algorithms
: Automated deduction systems can considerably be improved by replacing axioms with special purpose inference mechanisms. For example replacing in resolution based systems certain ...
Hans Jürgen Ohlbach
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
15 years 4 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
15 years 4 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
118
Voted
AIIA
2003
Springer
15 years 4 months ago
Abduction in Classification Tasks
The aim of this paper is to show how abduction can be used in classification tasks when we deal with incomplete data. Some classifiers, even if based on decision tree induction lik...
Maurizio Atzori, Paolo Mancarella, Franco Turini