Results 11  20
of
1,102,087
Towards Optimal epsilonApproximate Nearest Neighbor Algorithms in Constant Dimensions
 J. Algorithms
, 2001
"... this paper, and presents what is to our knowledge the first application of stratified trees (van Emde Boas trees) to multidimensional problems. They demonstrate a twopart algorithm that performs # approximate nearest neighbor queries in expected O (d + log log N + log 1/#) ..."
Abstract
 Add to MetaCart
this paper, and presents what is to our knowledge the first application of stratified trees (van Emde Boas trees) to multidimensional problems. They demonstrate a twopart algorithm that performs # approximate nearest neighbor queries in expected O (d + log log N + log 1/#)
Global mortality, disability, and the contribution of risk factors
 Global Burden of Disease Study. Lancet
, 1997
"... taken into account, our list differs substantially from other lists of the leading causes of death. DALYs provide a common metric to aid meaningful comparison of the burden of risk factors, diseases, and injuries. Lancet 1997; 349: 1436–42 ..."
Abstract

Cited by 430 (0 self)
 Add to MetaCart
taken into account, our list differs substantially from other lists of the leading causes of death. DALYs provide a common metric to aid meaningful comparison of the burden of risk factors, diseases, and injuries. Lancet 1997; 349: 1436–42
A SubConstant ErrorProbability LowDegree Test, and a SubConstant ErrorProbability PCP Characterization of NP
 IN PROC. 29TH ACM SYMP. ON THEORY OF COMPUTING, 475484. EL PASO
, 1997
"... We introduce a new lowdegreetest, one that uses the restriction of lowdegree polynomials to planes (i.e., affine subspaces of dimension 2), rather than the restriction to lines (i.e., affine subspaces of dimension 1). We prove the new test to be of a very small errorprobability (in particular, ..."
Abstract

Cited by 322 (20 self)
 Add to MetaCart
We introduce a new lowdegreetest, one that uses the restriction of lowdegree polynomials to planes (i.e., affine subspaces of dimension 2), rather than the restriction to lines (i.e., affine subspaces of dimension 1). We prove the new test to be of a very small errorprobability (in particular
Conformal deformation of a Riemannian metric to constant curvature
 J. Diff. Geome
, 1984
"... A wellknown open question in differential geometry is the question of whether a given compact Riemannian manifold is necessarily conformally equivalent to one of constant scalar curvature. This problem is known as the Yamabe problem because it was formulated by Yamabe [8] in 1960, While Yamabe&apos ..."
Abstract

Cited by 309 (0 self)
 Add to MetaCart
. Aubin [1] in 1976. Aubin showed that if dim M> 6 and M is not conformally flat, then M can be conformally changed to constant scalar curvature. Up until this time, Aubin's method has given no information on the Yamabe problem in dimensions 3, 4, and 5. Moreover, his method exploits only
Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Subspace Distance 4
"... Abstract. It is shown that the maximum size of a binary subspace code of packet length v = 6, minimum subspace distance d = 4, and constant dimension k = 3 is M = 77; in Finite Geometry terms, the maximum number of planes in PG(5; 2) mutually intersecting in at most a point is 77. Optimal binary ( ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. It is shown that the maximum size of a binary subspace code of packet length v = 6, minimum subspace distance d = 4, and constant dimension k = 3 is M = 77; in Finite Geometry terms, the maximum number of planes in PG(5; 2) mutually intersecting in at most a point is 77. Optimal binary
Polynomial time approximation schemes for Euclidean Traveling Salesman and other geometric problems
, 1998
"... We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c � 1 and given any n nodes in � 2, a randomized version of the scheme finds a (1 � 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes are in � ..."
Abstract

Cited by 390 (2 self)
 Add to MetaCart
We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c � 1 and given any n nodes in � 2, a randomized version of the scheme finds a (1 � 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes
Performance analysis of kary ncube interconnection networks
 IEEE Transactions on Computers
, 1990
"... AbstmctVLSI communication networks are wirelimited. The cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. This paper analyzes communication networks of varying dimension under the assumption of co ..."
Abstract

Cited by 355 (18 self)
 Add to MetaCart
AbstmctVLSI communication networks are wirelimited. The cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. This paper analyzes communication networks of varying dimension under the assumption
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
Quantization of Fourform Fluxes and Dynamical Neutralization Of The Cosmological Constant
, 2000
"... A fourform gauge flux makes a variable contribution to the cosmological constant. This has often been assumed to take continuous values, but we argue that it has a generalized Dirac quantization condition. For a single flux the steps are much larger than the observational limit, but we show that wi ..."
Abstract

Cited by 273 (19 self)
 Add to MetaCart
A fourform gauge flux makes a variable contribution to the cosmological constant. This has often been assumed to take continuous values, but we argue that it has a generalized Dirac quantization condition. For a single flux the steps are much larger than the observational limit, but we show
Decomposition of a Chemical Spectrum using a Marked Point Process and a Constant Dimension Model
"... Abstract. We consider the problem of estimating the peak parameters in a spectroscopic signal, i.e. their locations, amplitudes and form parameters. A marked point process provides a suitable representation for this phenomenon: it consists in modeling the spectrum as a noisy sum of points lying in t ..."
Abstract
 Add to MetaCart
in which the dimension model is constant: consequently, the Gibbs sampler appears possible and natural. The idea consists in considering an upper bound for peak number and modelling the peak occurrence by a Bernoulli distribution. At last, a label switching method adapted to the approach is also proposed
Results 11  20
of
1,102,087