Results 1  10
of
1,429,430
Heuristic algorithms for scheduling independent tasks on nonidentical processors
 Journal of the ACM
, 1977
"... ABSTRACt. The finishing time properties of several heuristic algorithms for scheduhng n independent tasks on m nonidentical processors are studied In particular, for m = 2 an n log n timebounded algorithm is given which generates a schedule having a fimshmg Ume of at most (.,/5 + 1)/2 of the optima ..."
Abstract

Cited by 244 (0 self)
 Add to MetaCart
ABSTRACt. The finishing time properties of several heuristic algorithms for scheduhng n independent tasks on m nonidentical processors are studied In particular, for m = 2 an n log n timebounded algorithm is given which generates a schedule having a fimshmg Ume of at most (.,/5 + 1
Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems
 Journal of Parallel and Distributed Computing
, 1999
"... This paper describes and compares eight heuristics that can be used in such an RMS for dynamically assigning independent tasks to machines ..."
Abstract

Cited by 208 (52 self)
 Add to MetaCart
This paper describes and compares eight heuristics that can be used in such an RMS for dynamically assigning independent tasks to machines
Scheduling Independent Tasks with Voltage
"... Abstract: In this paper, we discuss several scheduling algorithms to execute independent tasks with voltage overscaling. Given a frequency to execute the tasks, operating at a voltage below threshold leads to significant energy savings but also induces timing errors. A verification mechanism must b ..."
Abstract
 Add to MetaCart
Abstract: In this paper, we discuss several scheduling algorithms to execute independent tasks with voltage overscaling. Given a frequency to execute the tasks, operating at a voltage below threshold leads to significant energy savings but also induces timing errors. A verification mechanism must
A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems
, 2001
"... this paper is organized as follows. Section 2 defines the computational environment parameters that were varied in the simulations. Descriptions of the 11 mapping heuristics are found in Section 3. Section 4 examines selected results from the simulation study. A list of implementation parameters and ..."
Abstract

Cited by 327 (55 self)
 Add to MetaCart
this paper is organized as follows. Section 2 defines the computational environment parameters that were varied in the simulations. Descriptions of the 11 mapping heuristics are found in Section 3. Section 4 examines selected results from the simulation study. A list of implementation parameters and procedures that could be varied for each heuristic is presented in Section 5
Allocating Independent Tasks
, 1997
"... One of the most important problems in the efficient use of parallel systems is to distribute the workload evenly among the servers. An instance of this problem is the problem of independent allocations where the tasks can be executed independently. This paper presents an overview on some results obt ..."
Abstract
 Add to MetaCart
One of the most important problems in the efficient use of parallel systems is to distribute the workload evenly among the servers. An instance of this problem is the problem of independent allocations where the tasks can be executed independently. This paper presents an overview on some results
Survey on Independent Component Analysis
 NEURAL COMPUTING SURVEYS
, 1999
"... A common problem encountered in such disciplines as statistics, data analysis, signal processing, and neural network research, is nding a suitable representation of multivariate data. For computational and conceptual simplicity, such a representation is often sought as a linear transformation of the ..."
Abstract

Cited by 2241 (104 self)
 Add to MetaCart
of the original data. Wellknown linear transformation methods include, for example, principal component analysis, factor analysis, and projection pursuit. A recently developed linear transformation method is independent component analysis (ICA), in which the desired representation is the one that minimizes
Naive (Bayes) at Forty: The Independence Assumption in Information Retrieval
, 1998
"... The naive Bayes classifier, currently experiencing a renaissance in machine learning, has long been a core technique in information retrieval. We review some of the variations of naive Bayes models used for text retrieval and classification, focusing on the distributional assump tions made abou ..."
Abstract

Cited by 496 (1 self)
 Add to MetaCart
The naive Bayes classifier, currently experiencing a renaissance in machine learning, has long been a core technique in information retrieval. We review some of the variations of naive Bayes models used for text retrieval and classification, focusing on the distributional assump tions made about word occurrences in documents.
High confidence visual recognition of persons by a test of statistical independence
 IEEE Trans. on Pattern Analysis and Machine Intelligence
, 1993
"... Abstruct A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a samp ..."
Abstract

Cited by 596 (8 self)
 Add to MetaCart
Abstruct A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a
An Approximate Algorithm for the Partitionable Independent Task Scheduling Problem
 University of Illinois, Urbana
, 1990
"... Scheduling a collection of tasks on a multiprocessor, consisting of p processors, that minimizes the maximum completion time has attracted a lot of attention in the literature [12]. In this paper, we introduce a new problem of scheduling a collection of independent tasks on a multiprocessor, called ..."
Abstract

Cited by 38 (6 self)
 Add to MetaCart
Scheduling a collection of tasks on a multiprocessor, consisting of p processors, that minimizes the maximum completion time has attracted a lot of attention in the literature [12]. In this paper, we introduce a new problem of scheduling a collection of independent tasks on a multiprocessor, called
On the use of independent tasks for face recognition
 In Proc. IEEE Conference on Pattern Recognition and Computer Vision (CVPR), Anchorage (AK
, 2008
"... We present a method for learning discriminative linear feature extraction using independent tasks. More concretely, given a target classification task, we consider a complementary classification task that is independent of the target one. For example, in face classification field, subject recognitio ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present a method for learning discriminative linear feature extraction using independent tasks. More concretely, given a target classification task, we consider a complementary classification task that is independent of the target one. For example, in face classification field, subject
Results 1  10
of
1,429,430