Sciweavers

8377 search results - page 1540 / 1676
» Scenarios - Introduction
Sort
View
KDD
1999
ACM
166views Data Mining» more  KDD 1999»
15 years 10 months ago
CACTUS - Clustering Categorical Data Using Summaries
Clustering is an important data mining problem. Most of the earlier work on clustering focussed on numeric attributes which have a natural ordering on their attribute values. Rece...
Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishn...
SIGADA
1999
Springer
15 years 10 months ago
Redistribution in distributed Ada
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
Scott James
NOMS
1998
IEEE
160views Communications» more  NOMS 1998»
15 years 10 months ago
SP-to-SP service ordering specification and its implementation
Network Management Forum (NMF) has defined a set of basic business processes dealing with major TMN service management functions such as performance management, fault management, b...
Graham Chen, Qinzheng Kong, Pierre-Yves Benain
RANDOM
1998
Springer
15 years 10 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
INFOCOM
1997
IEEE
15 years 10 months ago
A Near-Optimal Packet Scheduler for QoS Networks
A packet scheduler in a quality-of-service QoS network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implemen...
Dallas E. Wrege, Jörg Liebeherr
« Prev « First page 1540 / 1676 Last » Next »