• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 3,451
Next 10 →

Tapestry: A Resilient Global-scale Overlay for Service Deployment

by Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph, John D. Kubiatowicz - IEEE Journal on Selected Areas in Communications , 2004
"... We present Tapestry, a peer-to-peer overlay routing infrastructure offering efficient, scalable, locationindependent routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic Decentralized Object Location and Routing (DOLR) API ..."
Abstract - Cited by 598 (14 self) - Add to MetaCart
We present Tapestry, a peer-to-peer overlay routing infrastructure offering efficient, scalable, locationindependent routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic Decentralized Object Location and Routing (DOLR) API

Tapestry: An infrastructure for fault-tolerant wide-area location and routing

by Ben Y. Zhao, John Kubiatowicz, Anthony D. Joseph , 2001
"... In today’s chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components within this infrastructure interact in rich and complex ways, greatly stressing traditional approaches to name service and routing. This paper explores an alternative ..."
Abstract - Cited by 1250 (31 self) - Add to MetaCart
In today’s chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components within this infrastructure interact in rich and complex ways, greatly stressing traditional approaches to name service and routing. This paper explores

The Laplacian Pyramid as a Compact Image Code

by Peter J. Burt , Edward H. Adelson , 1983
"... We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixel-to-pixel correlations a ..."
Abstract - Cited by 1388 (12 self) - Add to MetaCart
We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixel-to-pixel correlations

Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems

by Antony Rowstron, Peter Druschel , 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for wide-area peer-to-peer applications. Pastry provides application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet. ..."
Abstract - Cited by 2075 (49 self) - Add to MetaCart
. It can be used to support a wide range of peer-to-peer applications like global data storage, global data sharing, and naming. An insert operation in Pastry stores an object at a user-defined number of diverse nodes within the Pastry network. A lookup operation reliably retrieves a copy of the requested

Local copying of orthogonal entangled quantum states

by Fabio Anselmi, Anthony Chefles, Martin B Plenio - New J. Phys
"... doi:10.1088/1367-2630/6/1/164 Abstract. In classical information theory one can, in principle, produce a perfect copy of any input state. In quantum information theory, the no cloning theorem prohibits exact copying of non-orthogonal states. Moreover, if we wish to copy multiparticle entangled state ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
states and can perform only local operations and classical communication (LOCC), then further restrictions apply. We investigate the problem of copying orthogonal, entangled quantum states with an entangled blank state under the restriction to LOCC. Throughout, the subsystems have finite dimension D. We

The Pathophysiology of Mitochondrial Cell Death This copy is for your personal, non-commercial use only. clicking here.colleagues, clients, or customers by , you can order high-quality copies for yourIf you wish to distribute this article to others here.f

by Douglas R. Green, Guido Kroemer - JULY 2004 629 DOI: 10.1126/science.1099320 , 626 (2004);305 Science
"... In the mitochondrial pathway of apoptosis, caspase activation is closely linked to mitochondrial outer membrane permeabilization (MOMP). Numerous pro-apoptotic signal-transducing molecules and pathological stimuli converge on mitochondria to induce MOMP. The local regulation and execution of MOMP in ..."
Abstract - Cited by 337 (2 self) - Add to MetaCart
In the mitochondrial pathway of apoptosis, caspase activation is closely linked to mitochondrial outer membrane permeabilization (MOMP). Numerous pro-apoptotic signal-transducing molecules and pathological stimuli converge on mitochondria to induce MOMP. The local regulation and execution of MOMP

IS AN OPTIMAL QUANTUM CLONER THE BEST CHOICE FOR LOCAL COPYING IN BROADCAST-

by Ing Entanglement , 1999
"... We point out that in broadcasting entanglement the use of a particular class of non-optimal but universal quantum cloners instead of an optimal one, to copy the qubits locally may be a better choice. We show that by giving up the optimality of the quantum cloner but not universality, a larger class ..."
Abstract - Add to MetaCart
We point out that in broadcasting entanglement the use of a particular class of non-optimal but universal quantum cloners instead of an optimal one, to copy the qubits locally may be a better choice. We show that by giving up the optimality of the quantum cloner but not universality, a larger class

Broadcasting of three qubit entanglement via local copying and entanglement swapping

by Satyabrata Adhikari, B. S. Choudhury , 2008
"... In this work, We investigate the problem of secretly broadcasting of three-qubit entangled state between two distant partners. The interesting feature of this problem is that starting from two particle entangled state shared between two distant partners we find that the action of local cloner on the ..."
Abstract - Add to MetaCart
In this work, We investigate the problem of secretly broadcasting of three-qubit entangled state between two distant partners. The interesting feature of this problem is that starting from two particle entangled state shared between two distant partners we find that the action of local cloner

Comment on “Local Copying of d × d-dimensional Partially Entangled Pure States”

by Ramij Rahaman
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Winnowing: Local Algorithms for Document Fingerprinting

by Saul Schleimer - Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data 2003 , 2003
"... Digital content is for copying: quotation, revision, plagiarism, and file sharing all create copies. Document fingerprinting is concerned with accurately identifying copying, including small partial copies, within large sets of documents. We introduce the class of local document fingerprinting algor ..."
Abstract - Cited by 264 (5 self) - Add to MetaCart
Digital content is for copying: quotation, revision, plagiarism, and file sharing all create copies. Document fingerprinting is concerned with accurately identifying copying, including small partial copies, within large sets of documents. We introduce the class of local document fingerprinting
Next 10 →
Results 1 - 10 of 3,451
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University