Results 1  10
of
8,492
3Uniform states and orthogonal arrays
"... between the combinatorial notion of orthogonal arrays and kuniform states and present open issue. ‘(B) Find for what N there are 3uniform states of Nqubits’. In this paper, we demonstrate the existence of 3uniform states of Nqubits for N=11,..,15". PACS number(s): O3.67.Hk, 03.65.Ud, 03.67 ..."
Abstract
 Add to MetaCart
between the combinatorial notion of orthogonal arrays and kuniform states and present open issue. ‘(B) Find for what N there are 3uniform states of Nqubits’. In this paper, we demonstrate the existence of 3uniform states of Nqubits for N=11,..,15". PACS number(s): O3.67.Hk, 03.65.Ud, 03
Compressive sensing
 IEEE Signal Processing Mag
, 2007
"... The Shannon/Nyquist sampling theorem tells us that in order to not lose information when uniformly sampling a signal we must sample at least two times faster than its bandwidth. In many applications, including digital image and video cameras, the Nyquist rate can be so high that we end up with too m ..."
Abstract

Cited by 696 (62 self)
 Add to MetaCart
The Shannon/Nyquist sampling theorem tells us that in order to not lose information when uniformly sampling a signal we must sample at least two times faster than its bandwidth. In many applications, including digital image and video cameras, the Nyquist rate can be so high that we end up with too
Principled design of the modern web architecture
 ACM Trans. Internet Techn
"... The World Wide Web has succeeded in large part because its software architecture has been designed to meet the needs of an Internetscale distributed hypermedia system. The modern Web architecture emphasizes scalability of component interactions, generality of interfaces, independent deployment of c ..."
Abstract

Cited by 531 (14 self)
 Add to MetaCart
of components, and intermediary components to reduce interaction latency, enforce security, and encapsulate legacy systems. In this paper, we introduce the Representational State Transfer (REST) architectural style, developed as an abstract model of the Web architecture to guide our redesign and definition
Architectural Styles and the Design of Networkbased Software Architectures
, 2000
"...
The World Wide Web has succeeded in large part because its software architecture has been designed to meet the needs of an Internetscale distributed hypermedia system. The Web has been iteratively developed over the past ten years through a series of modifications to the standards that define its ..."
Abstract

Cited by 1119 (1 self)
 Add to MetaCart
to the architectural properties they induce on an architecture for distributed hypermedia. I then introduce the Representational State Transfer (REST) architectural style and describe how REST has been used to guide the design and development of the architecture for the modern Web.
REST emphasizes scalability
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
likelihood weighting 3.1 The PYRAMID network All nodes were binary and the conditional probabilities were represented by tablesentries in the conditional probability tables (CPTs) were chosen uniformly in the range (0, 1]. 3.2 The toyQMR network All nodes were binary and the conditional probabilities
Classification of Wetlands and Deepwater Habitats of the United States
 FWS/OBS79/31. USDI, U.S. Fish and Wildlife Service, Office of Biological Service. 103
, 1979
"... This classification, to be used in a new inventory of wetlands and deepwater habitats of the United States, is intended to describe ecological taxa, arrange them in a system useful to resource managers, furnish units for mapping, and provide uniformity of concepts and terms. Wetlands are defined by ..."
Abstract

Cited by 411 (1 self)
 Add to MetaCart
This classification, to be used in a new inventory of wetlands and deepwater habitats of the United States, is intended to describe ecological taxa, arrange them in a system useful to resource managers, furnish units for mapping, and provide uniformity of concepts and terms. Wetlands are defined
SWAPPING BASED JOINT ESTIMATION OF UNIFORM STATE MODEL
"... The paper presents an algorithm for the online joint parameter and state estimation of the state model whose innovations are uniformly distributed. We use a Bayesian approach and evaluate a maximum a posteriori probability (MAP) estimates in discrete time instants. As the model innovations have a ..."
Abstract
 Add to MetaCart
The paper presents an algorithm for the online joint parameter and state estimation of the state model whose innovations are uniformly distributed. We use a Bayesian approach and evaluate a maximum a posteriori probability (MAP) estimates in discrete time instants. As the model innovations have a
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract

Cited by 376 (38 self)
 Add to MetaCart
We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like
Approximating the permanent
 SIAM J. Computing
, 1989
"... Abstract. A randomised approximation scheme for the permanent of a 01 matrix is presented. The task of estimating a permanent is reduced to that of almost uniformly generating perfect matchings in a graph; the latter is accomplished by simulating a Markov chain whose states are the matchings in the ..."
Abstract

Cited by 345 (26 self)
 Add to MetaCart
Abstract. A randomised approximation scheme for the permanent of a 01 matrix is presented. The task of estimating a permanent is reduced to that of almost uniformly generating perfect matchings in a graph; the latter is accomplished by simulating a Markov chain whose states are the matchings
Mercury: Supporting scalable multiattribute range queries
 In SIGCOMM
, 2004
"... This paper presents the design of Mercury, a scalable protocol for supporting multiattribute rangebased searches. Mercury differs from previous rangebased query systems in that it supports multiple attributes as well as performs explicit load balancing. Efficient routing and load balancing are imp ..."
Abstract

Cited by 339 (6 self)
 Add to MetaCart
are implemented using novel lightweight sampling mechanisms for uniformly sampling random nodes in a highly dynamic overlay network. Our evaluation shows that Mercury is able to achieve its goals of logarithmichop routing and nearuniform load balancing. We also show that a publishsubscribe system based
Results 1  10
of
8,492