Results 11  20
of
1,887
Progressive Approximate Aggregate Queries with a MultiResolution Tree Structure
, 2001
"... Answering aggregate queries like SUM, COUNT, MIN, MAX, AVG in an approximate manner is often desirable when the exact answer is not needed or too costly to compute. We present an algorithm for answering such queries in multidimensional databases, using selective traversal of a MultiResolution Aggr ..."
Abstract

Cited by 84 (8 self)
 Add to MetaCart
Answering aggregate queries like SUM, COUNT, MIN, MAX, AVG in an approximate manner is often desirable when the exact answer is not needed or too costly to compute. We present an algorithm for answering such queries in multidimensional databases, using selective traversal of a Multi
A simpler approach to matrix completion
 the Journal of Machine Learning Research
"... This paper provides the best bounds to date on the number of randomly sampled entries required to reconstruct an unknown low rank matrix. These results improve on prior work by Candès and Recht [4], Candès and Tao [7], and Keshavan, Montanari, and Oh [18]. The reconstruction is accomplished by minim ..."
Abstract

Cited by 158 (6 self)
 Add to MetaCart
by minimizing the nuclear norm, or sum of the singular values, of the hidden matrix subject to agreement with the provided entries. If the underlying matrix satisfies a certain incoherence condition, then the number of entries required is equal to a quadratic logarithmic factor times the number of parameters
Sum rules on quantum hadrodynamics
, 2008
"... The development on relativistic nuclear manybody theories is reviewed. The second order selfenergies of hadrons are calculated both in the framework of quantum hadrodynamics(QHD) and from ˆ S2 matrix elements, and the results are same as each other. Therefore, a new method to solve nuclear manybo ..."
Abstract
 Add to MetaCart
body problems, sum rules on quantum hadrodynamics, is summarized in the calculation of the second
Sum rules on quantum hadrodynamics
, 2008
"... The development on relativistic nuclear manybody theories is reviewed. The selfenergies of hadrons are calculated both in the framework of quantum hadrodynamics(QHD) and from ˆ S2 matrix elements, and the results from these two methods are same as each other, respectively. Therefore, a new method, ..."
Abstract
 Add to MetaCart
, sum rules on quantum hadrodynamics, is summarized in the calculation of the selfenergies of hadrons from ˆ S2 matrix elements to solve the nuclear manybody problems. The
Thermodynamics Of Black Holes
 In Antide Sitter
, 1983
"... One would expect spacetime to have a foamlike structure on the Planck scale with a very high topology. If spacetime is simply connected (which is assumed in this paper), the nontrivial homology occurs in dimension two, and spacetime can be regarded as being essentially the topological sum of S 2 × ..."
Abstract

Cited by 149 (0 self)
 Add to MetaCart
One would expect spacetime to have a foamlike structure on the Planck scale with a very high topology. If spacetime is simply connected (which is assumed in this paper), the nontrivial homology occurs in dimension two, and spacetime can be regarded as being essentially the topological sum of S 2
A Lorentzian signature model for quantum general relativity
, 1999
"... We give a relativistic spin network model for quantum gravity based on the Lorentz group and its qdeformation, the Quantum Lorentz Algebra. We propose a combinatorial model for the path integral given by an integral over suitable representations of this algebra. This generalises the state sum mod ..."
Abstract

Cited by 105 (8 self)
 Add to MetaCart
We give a relativistic spin network model for quantum gravity based on the Lorentz group and its qdeformation, the Quantum Lorentz Algebra. We propose a combinatorial model for the path integral given by an integral over suitable representations of this algebra. This generalises the state sum
Paritybased Inference Control for Multidimensional Range Sum Queries
"... This paper studies the inference control of multidimensional range (MDR) sum queries. We show that existing inference control methods are usually inefficient for MDR queries. We then consider paritybased inference control that restricts users to queries involving even number of sensitive values. S ..."
Abstract
 Add to MetaCart
This paper studies the inference control of multidimensional range (MDR) sum queries. We show that existing inference control methods are usually inefficient for MDR queries. We then consider paritybased inference control that restricts users to queries involving even number of sensitive values. Such
Honeycombs and sums of Hermitian matrices
 NOTICES AMER. MATH. SOC
, 2008
"... Horn’s conjecture [Ho], which given the spectra of two Hermitian matrices describes the possible spectra of the sum, was recently settled in the affirmative. We discuss one of the many steps in this, which required us to introduce a combinatorial gadget called a honeycomb; the question is then ref ..."
Abstract

Cited by 44 (0 self)
 Add to MetaCart
Horn’s conjecture [Ho], which given the spectra of two Hermitian matrices describes the possible spectra of the sum, was recently settled in the affirmative. We discuss one of the many steps in this, which required us to introduce a combinatorial gadget called a honeycomb; the question
State Sum Models for Quantum Gravity
"... Abstract. This review gives a history of the construction of quantum field theory on fourdimensional spacetime using combinatorial techniques, and recent developments of the theory towards a combinatorial construction of quantum gravity. 1. State sum models In this short review I give a brief surve ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. This review gives a history of the construction of quantum field theory on fourdimensional spacetime using combinatorial techniques, and recent developments of the theory towards a combinatorial construction of quantum gravity. 1. State sum models In this short review I give a brief
QUANTUM STRATEGIES
, 1998
"... We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). We introduce these basic ideas in the context of a simple example, closely related to the traditional MATCHING PENNIES game. While not eve ..."
Abstract

Cited by 61 (0 self)
 Add to MetaCart
We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). We introduce these basic ideas in the context of a simple example, closely related to the traditional MATCHING PENNIES game. While
Results 11  20
of
1,887