Results 1  10
of
740,655
K.: Speed scaling with an arbitrary power function
 In: Proc. 20th ACMSIAM Symposium on Discrete Algorithm
, 2009
"... “What matters most to the computer designers at Google is not speed, but power, low power, because data centers can consume as much electricity as a city.” —Dr. Eric Schmidt, CEO of Google [12]. All of the theoretical speed scaling research to date has assumed that the power function, which expresse ..."
Abstract

Cited by 62 (9 self)
 Add to MetaCart
expresses the power consumption P as a function of the processor speed s, is of the form P = s α, where α> 1 is some constant. Motivated in part by technological advances, we initiate a study of speed scaling with arbitrary power functions. We consider the problem of minimizing the total flow plus energy
Transformative Biometrics and the exercise of arbitrary power
"... Abstract: This paper argues that biometrics have been reframed in ways that decouple them from the discourse of balancing liberty and security with profound implications for the exercise of democratically legitimated power at a time when the transformative impact of ICTs on governance and society ..."
Abstract
 Add to MetaCart
Abstract: This paper argues that biometrics have been reframed in ways that decouple them from the discourse of balancing liberty and security with profound implications for the exercise of democratically legitimated power at a time when the transformative impact of ICTs on governance and society
High dimensional graphs and variable selection with the Lasso
 ANNALS OF STATISTICS
, 2006
"... The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a ..."
Abstract

Cited by 751 (23 self)
 Add to MetaCart
joining some distinct connectivity components of the graph, consistent estimation for sparse graphs is achieved (with exponential rates), even when the number of variables grows as the number of observations raised to an arbitrary power.
Critical Power for Asymptotic Connectivity in Wireless Networks
, 1998
"... : In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others ' pack ..."
Abstract

Cited by 548 (19 self)
 Add to MetaCart
: In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others &apos
A Framework for Uplink Power Control in Cellular Radio Systems
 IEEE Journal on Selected Areas in Communications
, 1996
"... In cellular wireless communication systems, transmitted power is regulated to provide each user an acceptable connection by limiting the interference caused by other users. Several models have been considered including: (1) fixed base station assignment where the assignment of users to base stations ..."
Abstract

Cited by 636 (18 self)
 Add to MetaCart
In cellular wireless communication systems, transmitted power is regulated to provide each user an acceptable connection by limiting the interference caused by other users. Several models have been considered including: (1) fixed base station assignment where the assignment of users to base
On a generalised Lehmer problem for arbitrary powers
 EastWest J. Math. 2008, Special
"... We consider a generalisation of the classical Lehmer problem about the parity distribution of an integer and its modular inverse. We use some known estimates of exponential sums to study a more general question of simultaneous distribution of the residues of any fixed number of negative and positive ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
and positive powers of integers in prescribed arithmetic progressions. In particular, we improve and generalise a recent result of Y. Yi and W. Zhang. 1
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms
Maximum entropy markov models for information extraction and segmentation
, 2000
"... Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many textrelated tasks, such as partofspeech tagging, text segmentation and information extraction. In these cases, the observations are usually modeled as multinomial ..."
Abstract

Cited by 554 (18 self)
 Add to MetaCart
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many textrelated tasks, such as partofspeech tagging, text segmentation and information extraction. In these cases, the observations are usually modeled
Results 1  10
of
740,655