2492 search results - page 236 / 499 » On the General Signature Trees |
179
click to vote
PAKDD
2005
ACM
16 years 3 days ago
2005
ACM
Abstract. In this paper we present a novel and general framework based on concepts of relational algebra for kernel-based learning over relational schema. We exploit the notion of ...
155
click to vote
CLUSTER
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we present a structure for monitoring a large set of computational clusters. We illustrate methods for scaling a monitor network comprised of many clusters while ke...
165
Voted
COMPGEOM
1993
ACM
15 years 10 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
167
click to vote
CONPAR
1992
15 years 10 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
177
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...