Results 1  10
of
9,960
Weighted Voting for Replicated Data
, 1979
"... In a new algorithm for maintaining replicated data, every copy of a replicated file is assigned some number of votes. Every transaction collects a read quorum of r votes to read a file, and a write quorum of w votes to write a file, such that r+w is greater than the total number number of votes assi ..."
Abstract

Cited by 598 (0 self)
 Add to MetaCart
In a new algorithm for maintaining replicated data, every copy of a replicated file is assigned some number of votes. Every transaction collects a read quorum of r votes to read a file, and a write quorum of w votes to write a file, such that r+w is greater than the total number number of votes
Deterministic TimeVarying Packet Fair Queueing for Integrated Services Networks
, 2000
"... Packet Fair Queueing (PFQ) algorithms have been extensively studied for provision of Quality of Service (QoS) guarantees in Integrated Services Networks. Because of the fixed weight assignment, the inherent in PFQ delaybandwidth coupling imposes limitatious on the range of QoS that can be supported ..."
Abstract
 Add to MetaCart
be supported. We develop PFQ with determlnlntic timevarying weight assignments, and we propose a lowoverhead algorithm capable of supporting arbitrary piecewise linear service curves which achieve delaybandwidth decoupling. Unlike existing servieeenrve based algorithms, our timevarying PFQ scheme
TimeVarying Fair Queuing Scheduling For Multicode Cdma Based On Dynamic Programming
"... Fair Queuing (FQ) algorithms, which have been proposed for QoS wirelinewireless networking, rely on the fundamental idea that the service rate allocated to user proportional to a positive weight . Targeting wireless data networks with a multicode CDMAbased physical layer, we develop FQ w ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
with timevarying weight assignments in order to minimize the queuing delays of mobile users. Applying dynamic programming, we design a computationally efficient algorithm which produces the optimal service rates while obeying i) constraints imposed by the underlying physical layer, and ii) Qo
Termweighting approaches in automatic text retrieval
 INFORMATION PROCESSING AND MANAGEMENT
, 1988
"... The experimental evidence accumulated over the past 20 years indicates that text indexing systems based on the assignment of appropriately weighted single terms produce retrieval results that are superior to those obtainable with other more elaborate text representations. These results depend crucia ..."
Abstract

Cited by 2189 (10 self)
 Add to MetaCart
The experimental evidence accumulated over the past 20 years indicates that text indexing systems based on the assignment of appropriately weighted single terms produce retrieval results that are superior to those obtainable with other more elaborate text representations. These results depend
TimeVarying Fair Queueing Scheduling for Multicode CDMA Based on Dynamic Programming
 IEEE Tran. on Wireless Communications
, 2004
"... Fair queueing (FQ) algorithms, which have been proposed for quality of service (QoS) wireline/wireless networking, rely on the fundamental idea that the service rate allocated to each user is proportional to a positive weight. Targeting wireless data networks with a multicode CDMAbased physical lay ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
layer, we develop FQ with timevarying weight assignment in order to minimize the queueing delays of mobile users. Applying dynamic programming, we design a computationally efficient algorithm which produces the optimal service rates while obeying 1) constraints imposed by the underlying physical layer
Vivaldi: A Decentralized Network Coordinate System
 In SIGCOMM
, 2004
"... Largescale Internet applications can benefit from an ability to predict roundtrip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a simp ..."
Abstract

Cited by 602 (4 self)
 Add to MetaCart
simple, lightweight algorithm that assigns synthetic coordinates to hosts such that the distance between the coordinates of two hosts accurately predicts the communication latency between the hosts.
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
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
convergence threshold of 104 , 98 out of 100 cases converged; when we lowered the threshold to 103 , all 100 cases converged. We also tried to avoid oscillations by using "momen tum"; replacing the messages that were sent at time t with a weighted average of the messages at times t and t1
A statistical interpretation of term specificity and its application in retrieval
 Journal of Documentation
, 1972
"... Abstract: The exhaustivity of document descriptions and the specificity of index terms are usually regarded as independent. It is suggested that specificity should be interpreted statistically, as a function of term use rather than of term meaning. The effects on retrieval of variations in term spec ..."
Abstract

Cited by 589 (3 self)
 Add to MetaCart
specificity are examined, experiments with three test collections showing, in particular, that frequentlyoccurring terms are required for good overall performance. It is argued that terms should be weighted according to collection frequency, so that matches on less frequent, more specific, terms
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
in the problem graph: ( 1) O(n log n + m) for the singlesource shortest path problem with nonnegative edge lengths, improved from O(m logfmh+2)n); (2) O(n*log n + nm) for the allpairs shortest path problem, improved from O(nm lo&,,,+2,n); (3) O(n*logn + nm) for the assignment problem (weighted bipartite
Results 1  10
of
9,960