Results 1  10
of
10,665
Optimal Aggregation Algorithms for Middleware
 IN PODS
, 2001
"... Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under ..."
Abstract

Cited by 717 (4 self)
 Add to MetaCart
simple algorithm (“the threshold algorithm”, or TA) that is optimal in a much stronger sense than FA. We show that TA is essentially optimal, not just for some monotone aggregation functions, but for all of them, and not just in a highprobability worstcase sense, but over every database. Unlike FA
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems
, 1992
"... We introduce the framework of hybrid automata as a model and specification language for hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in which the behavior of variables is governed in each state by a set of differential equations. We show that many of the examp ..."
Abstract

Cited by 460 (20 self)
 Add to MetaCart
We introduce the framework of hybrid automata as a model and specification language for hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in which the behavior of variables is governed in each state by a set of differential equations. We show that many
Selfadjusting binary search trees
, 1985
"... The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have an am ..."
Abstract

Cited by 432 (18 self)
 Add to MetaCart
an amortized time bound of O(log n) per operation, where by “amortized time ” is meant the time per operation averaged over a worstcase sequence of operations. Thus splay trees are as efficient as balanced trees when total running time is the measure of interest. In addition, for sufficiently long access
Linear multiuser detectors for synchronous codedivision multipleaccess channels
 IEEE TRANS. INFORM. THEORY
, 1989
"... In codedivision multipleaccess systems, simultaneous multiuser accessing of a common channel is made possible by assigning a signature waveform to each user. Knowledge of these waveforms enables the receiver to demodulate the data streams of each user, upon observation of the sum of the transmitt ..."
Abstract

Cited by 385 (4 self)
 Add to MetaCart
of the transmitted signals, perturbed by additive noise. Under the assumptions of symbolsynchronous transmissions and white Gaussian noise, we analyze the detection mechanism at the receiver, comparing different detectors by their bit error rate in the low background noise region, and by their worstcase behavior
How to Use Expert Advice
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1997
"... We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worstcase situations, i.e., we make no assumptions about the way the sequence of bits to be predicted is generated. We measure the performance of the ..."
Abstract

Cited by 377 (79 self)
 Add to MetaCart
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worstcase situations, i.e., we make no assumptions about the way the sequence of bits to be predicted is generated. We measure the performance
Latent Semantic Models for Collaborative filtering
 ACM Trans. Information Systems
"... Collaborative filtering aims at learning predictive models of user preferences, interests or behavior from community data, that is, a database of available user preferences. In this article, we describe a new family of modelbased algorithms designed for this task. These algorithms rely on a statist ..."
Abstract

Cited by 331 (1 self)
 Add to MetaCart
Collaborative filtering aims at learning predictive models of user preferences, interests or behavior from community data, that is, a database of available user preferences. In this article, we describe a new family of modelbased algorithms designed for this task. These algorithms rely on a
Geometric AdHoc Routing: Of Theory and Practice
, 2003
"... All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of adhoc routing. In particular we consider two aspects: We propose a new geometric routing algorithm which is outstandingly efficient ..."
Abstract

Cited by 317 (13 self)
 Add to MetaCart
on practical averagecase networks, however is also in theory asymptotically worstcase optimal. On the other hand we are able to drop the formerly necessary assumption that the distance between network nodes may not fall below a constant value, an assumption that cannot be maintained for practical networks
Timevarying NAIRU and its implications for Economic Policy
 NBER WORKING PAPER
, 1996
"... This paper estimates the NAIRU (standing for the nonaccelerating Inflation Rate of unemployment) as a parameter that varies over time. The NAIRU is the unemployment rate that is consistent with a constant rate of inflation. Its value is determined in an econometric model in which the inflation rate ..."
Abstract

Cited by 320 (4 self)
 Add to MetaCart
This paper estimates the NAIRU (standing for the nonaccelerating Inflation Rate of unemployment) as a parameter that varies over time. The NAIRU is the unemployment rate that is consistent with a constant rate of inflation. Its value is determined in an econometric model in which the inflation
Tight bounds for worstcase equilibria
 Proc. 13th SODA
, 2002
"... We study the problem of traffic routing in noncooperative networks. In such networks, users may follow selfish strategies to optimize their own performance measure and therefore their behavior does not have to lead to optimal performance of the entire network. In this paper we investigate the worst ..."
Abstract

Cited by 172 (5 self)
 Add to MetaCart
We study the problem of traffic routing in noncooperative networks. In such networks, users may follow selfish strategies to optimize their own performance measure and therefore their behavior does not have to lead to optimal performance of the entire network. In this paper we investigate
Selfcontrol as a limited resource: Regulatory depletion patterns
 Journal of Personality and Social Psychology
, 1998
"... If selfregulation conforms to an energy or strength model, then selfcontrol should be impaired by prior exertion. In Study 1, trying to regulate one's emotional response to an upsetting movie was followed by a decrease in physical stamina. In Study 2, suppressing forbidden thoughts led to a s ..."
Abstract

Cited by 314 (24 self)
 Add to MetaCart
to selfregulatory failure. A strength model of selfregulation fits the data better than activation, priming, skill, or constant capacity models of selfregulation. The capacity of the human organism to override, interrupt, and otherwise alter its own responses is one of the most dramatic and impressive
Results 1  10
of
10,665