Results 1  10
of
4,234,114
Why and Where: A Characterization of Data Provenance
 In ICDT
, 2001
"... With the proliferation of database views and curated databases, the issue of data provenance # where a piece of data came from and the process by which it arrived in the database # is becoming increasingly important, especially in scienti#c databases where understanding provenance is crucial to ..."
Abstract

Cited by 428 (18 self)
 Add to MetaCart
With the proliferation of database views and curated databases, the issue of data provenance # where a piece of data came from and the process by which it arrived in the database # is becoming increasingly important, especially in scienti#c databases where understanding provenance is crucial
Fibonacci Heaps and Their Uses in Improved Network . . .
, 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 t ..."
Abstract

Cited by 746 (18 self)
 Add to MetaCart
time and all other standard heap operations in o ( 1) amortized time. Using Fheaps we are able to obtain improved running times for several network optimization algorithms. In particular, we obtain the following worstcase bounds, where n is the number of vertices and m the number of edges
ERC  A Theory of Equity, Reciprocity and Competition
 FORTHCOMING AMERICAN ECONOMIC REVIEW
, 1999
"... We demonstrate that a simple model, constructed on the premise that people are motivated by both their pecuniary payoff and their relative payoff standing, explains behavior in a wide variety of laboratory games. Included are games where equity is thought to be a factor, such as ultimatum, twoperio ..."
Abstract

Cited by 699 (21 self)
 Add to MetaCart
We demonstrate that a simple model, constructed on the premise that people are motivated by both their pecuniary payoff and their relative payoff standing, explains behavior in a wide variety of laboratory games. Included are games where equity is thought to be a factor, such as ultimatum, two
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1055 (1 self)
 Add to MetaCart
the infimum is with respect to all auxiliary random variables Z (which take values in a finite set 3) that satisfy: i) Y,Z conditiofally independent given X; ii) there exists a functionf: “Y x E +.%, such that E[D(X,f(Y,Z))] 5 d. Let Rx, y(d) be the ratedistortion function which results when the encoder
Goaldirected Requirements Acquisition
 SCIENCE OF COMPUTER PROGRAMMING
, 1993
"... Requirements analysis includes a preliminary acquisition step where a global model for the specification of the system and its environment is elaborated. This model, called requirements model, involves concepts that are currently not supported by existing formal specification languages, such as goal ..."
Abstract

Cited by 572 (17 self)
 Add to MetaCart
Requirements analysis includes a preliminary acquisition step where a global model for the specification of the system and its environment is elaborated. This model, called requirements model, involves concepts that are currently not supported by existing formal specification languages
Functions from a set to a set
 Journal of Formalized Mathematics
, 1989
"... function from a set X into a set Y, denoted by “Function of X,Y ”, the set of all functions from a set X into a set Y, denoted by Funcs(X,Y), and the permutation of a set (mode Permutation of X, where X is a set). Theorems and schemes included in the article are reformulations of the theorems of [1] ..."
Abstract

Cited by 1094 (23 self)
 Add to MetaCart
function from a set X into a set Y, denoted by “Function of X,Y ”, the set of all functions from a set X into a set Y, denoted by Funcs(X,Y), and the permutation of a set (mode Permutation of X, where X is a set). Theorems and schemes included in the article are reformulations of the theorems of [1
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
stations is fixed, (2) minimum power assignment where a user is iteratively assigned to the base station at which its signal to interference ratio is highest, and (3) diversity reception, where a user's signal is combined from several or perhaps all base stations. For the above models, the uplink
Short signatures from the Weil pairing
, 2001
"... Abstract. We introduce a short signature scheme based on the Computational DiffieHellman assumption on certain elliptic and hyperelliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where signa ..."
Abstract

Cited by 743 (28 self)
 Add to MetaCart
Abstract. We introduce a short signature scheme based on the Computational DiffieHellman assumption on certain elliptic and hyperelliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where
Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
 Biometrika
, 1995
"... Markov chain Monte Carlo methods for Bayesian computation have until recently been restricted to problems where the joint distribution of all variables has a density with respect to some xed standard underlying measure. They have therefore not been available for application to Bayesian model determi ..."
Abstract

Cited by 1330 (24 self)
 Add to MetaCart
Markov chain Monte Carlo methods for Bayesian computation have until recently been restricted to problems where the joint distribution of all variables has a density with respect to some xed standard underlying measure. They have therefore not been available for application to Bayesian model
Relations defined on sets
 Journal of Formalized Mathematics
, 1989
"... Summary. The article includes theorems concerning properties of relations defined as a subset of the Cartesian product of two sets (mode Relation of X,Y where X,Y are sets). Some notions, introduced in [4] such as domain, codomain, field of a relation, composition of relations, image and inverse ima ..."
Abstract

Cited by 517 (0 self)
 Add to MetaCart
Summary. The article includes theorems concerning properties of relations defined as a subset of the Cartesian product of two sets (mode Relation of X,Y where X,Y are sets). Some notions, introduced in [4] such as domain, codomain, field of a relation, composition of relations, image and inverse
Results 1  10
of
4,234,114