Results 1  10
of
89,962
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
 IEEE Transactions on Parallel and Distributed Systems
"... We present a low complexity heuristic named the Dominant Sequence Clustering algorithm (DSC) for scheduling parallel tasks on an unbounded number of completely connected processors. The performance of DSC is comparable or even better on average than many other higher complexity algorithms. We assume ..."
Abstract

Cited by 209 (11 self)
 Add to MetaCart
We present a low complexity heuristic named the Dominant Sequence Clustering algorithm (DSC) for scheduling parallel tasks on an unbounded number of completely connected processors. The performance of DSC is comparable or even better on average than many other higher complexity algorithms. We
A Fast Static Scheduling Algorithm for DAGs on an Unbounded Number of Processors
, 1991
"... Scheduling parallel tasks on an unbounded number of completely connected processors when communication overhead is taken into account is NPcomplete. Assuming that task duplication is not allowed, we propose a fast heuristic algorithm, called the dominant sequence clustering algorithm (DSC), for thi ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
Scheduling parallel tasks on an unbounded number of completely connected processors when communication overhead is taken into account is NPcomplete. Assuming that task duplication is not allowed, we propose a fast heuristic algorithm, called the dominant sequence clustering algorithm (DSC
LTL Model Checking for Systems with Unbounded Number of Dynamically Created Threads and Objects
, 2001
"... . One of the stumbling blocks to applying model checking to a concurrent language such as Java is that a program's data structures (as well as the number of threads) can grow and shrink dynamically, with no fixed upper bound on their size or number. This paper presents a method for verifying LT ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
, and even programs that create an unbounded number of threads. 1
Universally composable security: A new paradigm for cryptographic protocols
, 2013
"... We present a general framework for representing cryptographic protocols and analyzing their security. The framework allows specifying the security requirements of practically any cryptographic task in a unified and systematic way. Furthermore, in this framework the security of protocols is preserved ..."
Abstract

Cited by 833 (37 self)
 Add to MetaCart
, protocols are guaranteed to maintain their security in any context, even in the presence of an unbounded number of arbitrary protocol instances that run concurrently in an adversarially controlled manner. This is a useful guarantee, that allows arguing about the security of cryptographic protocols
Efficient generic forwardsecure signatures with an unbounded number of time periods
 In Advances in Cryptology — Eurocrypt ’02, volume 2332 of LNCS
, 2002
"... ..."
GROUPWISE DENSITY CANNOT BE MUCH BIGGER THAN THE UNBOUNDED NUMBER
"... Abstract. We prove that g (the groupwise density number) is smaller or equal to b +, the successor of the minimal cardinality of an unbounded subset of ω ω. This is true even for the version of g for groupwise dense ideals. 1. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We prove that g (the groupwise density number) is smaller or equal to b +, the successor of the minimal cardinality of an unbounded subset of ω ω. This is true even for the version of g for groupwise dense ideals. 1.
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words
 In Proc. of 9th Annual International Symposium on Algorithms and Computation
, 1998
"... We study the efficient discovery of wordassociation patterns, defined by a sequence of strings and a proximity gap between them, from a collection of texts with binary labels. We present an algorithm that finds all d strings and k proximity wordassociation patterns that maximizes agreement with th ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We study the efficient discovery of wordassociation patterns, defined by a sequence of strings and a proximity gap between them, from a collection of texts with binary labels. We present an algorithm that finds all d strings and k proximity wordassociation patterns that maximizes agreement with the labels. It runs in expected time complexity O(k d01 n log d+1 n) and O(k d01 n) space with the total length n of texts, if texts are uniformly random strings. We also show that finding a best wordassociation pattern with arbitrarily many strings is intractable and hard to approximate within a factor arbitrary close to one, i.e., has no polynomialtime approximation scheme unless P=NP. 1 Introduction Data mining emerged in early 1990's [1] aims to devise semiautomatic tools for discovering valuable "association rules" from facts stored in large scale databases. An association rule is an implication between two conditions, namely a presumptive condition and the objective condition [...
or Unbounded number of channel uses are required to see quantum capacity
"... The only general formula known for the quantum capacity Q of a channel is the large n limit of Q(n) – the maximal coherent information per channel use for n uses of the channel. We show that for any n there are channels for which Q(n) is zero, but which still have positive quantum capacity. Therefo ..."
Abstract
 Add to MetaCart
. Therefore, in general, one may have to consider the coherent information for an arbitrarily large number of channel uses just to establish that the channel has nonzero capacity, Q> 0. To solve practical problems of information transmission we need to characterise the utility of the available resources
Results 1  10
of
89,962