Results 1  10
of
4,596,150
A scheduling model for reduced CPU energy
 ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract

Cited by 550 (3 self)
 Add to MetaCart
an offline algorithm that computes, for any set of jobs, a minimumenergy schedule. We then consider some online algorithms and their competitive performance for the power function P(s) = sp where p 3 2. It is shown that one natural heuristic, called the Average Rate heuristic, uses at most a constant
Reducing Multiclass to Binary: A Unifying Approach for Margin Classifiers
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2000
"... We present a unifying framework for studying the solution of multiclass categorization problems by reducing them to multiple binary problems that are then solved using a marginbased binary learning algorithm. The proposed framework unifies some of the most popular approaches in which each class ..."
Abstract

Cited by 560 (20 self)
 Add to MetaCart
We present a unifying framework for studying the solution of multiclass categorization problems by reducing them to multiple binary problems that are then solved using a marginbased binary learning algorithm. The proposed framework unifies some of the most popular approaches in which each class
Greedy Function Approximation: A Gradient Boosting Machine
 Annals of Statistics
, 2000
"... Function approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest{descent minimization. A general gradient{descent \boosting" paradigm is developed for additi ..."
Abstract

Cited by 951 (12 self)
 Add to MetaCart
Function approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest{descent minimization. A general gradient{descent \boosting" paradigm is developed
Stochastic Perturbation Theory
, 1988
"... . In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a firstorder perturbation expansion, in which the perturbation is assumed to be random. This permits the computation of statistics estimating the variatio ..."
Abstract

Cited by 886 (35 self)
 Add to MetaCart
. In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a firstorder perturbation expansion, in which the perturbation is assumed to be random. This permits the computation of statistics estimating
Estimating the Support of a HighDimensional Distribution
, 1999
"... Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We propo ..."
Abstract

Cited by 766 (29 self)
 Add to MetaCart
propose a method to approach this problem by trying to estimate a function f which is positive on S and negative on the complement. The functional form of f is given by a kernel expansion in terms of a potentially small subset of the training data; it is regularized by controlling the length
Modern Information Retrieval
, 1999
"... Information retrieval (IR) has changed considerably in the last years with the expansion of the Web (World Wide Web) and the advent of modern and inexpensive graphical user interfaces and mass storage devices. As a result, traditional IR textbooks have become quite outofdate which has led to the i ..."
Abstract

Cited by 3155 (28 self)
 Add to MetaCart
Information retrieval (IR) has changed considerably in the last years with the expansion of the Web (World Wide Web) and the advent of modern and inexpensive graphical user interfaces and mass storage devices. As a result, traditional IR textbooks have become quite outofdate which has led
Determinants of Economic Growth: A CrossCountry Empirical Study
, 1996
"... Empirical findings for a panel of around 100 countries from 1960 to 1990 strongly support the general notion of conditional convergence. For a given starting level of real per capita GDP, the growth rate is enhanced by higher initial schooling and life expectancy, lower fertility, lower government c ..."
Abstract

Cited by 859 (14 self)
 Add to MetaCart
of a nonlinear relation. At low levels of political rights, an expansion of these rights stimulates economic growth. However, once a moderate amount of democracy has been attained, a further expansion reduces growth. In contrast to the small effect of democracy on growth, there is a strong positive
An Efficient Boosting Algorithm for Combining Preferences
, 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract

Cited by 707 (18 self)
 Add to MetaCart
search strategies, each of which is a query expansion for a given domain. For this task, we compare the performance of RankBoost to the individual search strategies. The second experiment is a collaborativefiltering task for making movie recommendations. Here, we present results comparing Rank
Face recognition: features versus templates
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1993
"... AbstractOver the last 20 years, several different techniques have been proposed for computer recognition of human faces. The purpose of this paper is to compare two simple but general strategies on a common database (frontal images of faces of 47 people: 26 males and 21 females, four images per per ..."
Abstract

Cited by 737 (25 self)
 Add to MetaCart
AbstractOver the last 20 years, several different techniques have been proposed for computer recognition of human faces. The purpose of this paper is to compare two simple but general strategies on a common database (frontal images of faces of 47 people: 26 males and 21 females, four images per
A simple transmit diversity technique for wireless communications
 IEEE Journal on Selected Areas in Communications
, 1998
"... Abstract — This paper presents a simple twobranch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme provides the same diversity order as maximalratio receiver combining (MRRC) with one transmit antenna, and two receive antennas. It is also shown that the sch ..."
Abstract

Cited by 2084 (0 self)
 Add to MetaCart
that the scheme may easily be generalized to two transmit antennas and M receive antennas to provide a diversity order of 2M. The new scheme does not require any bandwidth expansion any feedback from the receiver to the transmitter and its computation complexity is similar to MRRC. Index Terms—Antenna array
Results 1  10
of
4,596,150