Results 1 - 10 of 3,859

SCRIBE: A large-scale and decentralized application-level multicast infrastructure

by Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, Antony Rowstron - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS (JSAC , 2002
"... This paper presents Scribe, a scalable application-level multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, ..."
Abstract - Cited by 658 (29 self) - Add to MetaCart
This paper presents Scribe, a scalable application-level multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet

The resonance counting function for Schrödinger operators with generic potentials

by T. Christiansen, P. D. Hislop - Math. Research Letters
"... Abstract. We show that the resonance counting function for a Schrödinger operator has maximal order of growth for generic sets of real-valued, or complex-valued, L ∞-compactly supported potentials. 1. ..."
Abstract - Cited by 13 (7 self) - Add to MetaCart
Abstract. We show that the resonance counting function for a Schrödinger operator has maximal order of growth for generic sets of real-valued, or complex-valued, L ∞-compactly supported potentials. 1.

GRASP - A New Search Algorithm for Satisfiability

by Joso L Marques Silva , 1996
"... This paper introduces GRASP (Generic seaRch Algorithm for the Satisjiability Problem), an integrated algorithmic framework for SAT that un.$es several previously proposed searchpruning techniques and facilitates ident$cation of additional ones. GRASP is premised on the inevitability of confzicts dur ..."
Abstract - Cited by 449 (34 self) - Add to MetaCart
This paper introduces GRASP (Generic seaRch Algorithm for the Satisjiability Problem), an integrated algorithmic framework for SAT that un.$es several previously proposed searchpruning techniques and facilitates ident$cation of additional ones. GRASP is premised on the inevitability of confzicts

Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory

by Reza Olfati-Saber , 2006
"... In this paper, we present a theoretical framework for design and analysis of distributed flocking algorithms. Two cases of flocking in free-space and presence of multiple obstacles are considered. We present three flocking algorithms: two for free-flocking and one for constrained flocking. A compre ..."
Abstract - Cited by 436 (2 self) - Add to MetaCart
comprehensive analysis of the first two algorithms is provided. We demonstrate the first algorithm embodies all three rules of Reynolds. This is a formal approach to extraction of interaction rules that lead to the emergence of collective behavior. We show that the first algorithm generically leads to regular

The neural basis of human error processing: Reinforcement learning, dopamine, and the error-related negativity

by Clay B. Holroyd, Michael G. H. Coles - PSYCHOLOGICAL REVIEW 109:679–709 , 2002
"... The authors present a unified account of 2 neural systems concerned with the development and expression of adaptive behaviors: a mesencephalic dopamine system for reinforcement learning and a “generic ” error-processing system associated with the anterior cingulate cortex. The existence of the error ..."
Abstract - Cited by 430 (20 self) - Add to MetaCart
The authors present a unified account of 2 neural systems concerned with the development and expression of adaptive behaviors: a mesencephalic dopamine system for reinforcement learning and a “generic ” error-processing system associated with the anterior cingulate cortex. The existence

MAXIMAL ORDER OF GROWTH FOR THE RESONANCE COUNTING FUNCTIONS FOR GENERIC POTENTIALS IN

by Even Dimensions, T. J. Christiansen, P. D. Hislop , 811
"... Abstract. We prove that the resonance counting functions for Schrödinger operators HV = − ∆ + V on L 2 (R d), for d ≥ 2 even, with generic, compactlysupported, real- or complex-valued potentials V, have the maximal order of growth d on each sheet Λm, m ∈ Z\{0}, of the logarithmic Riemann surface. We ..."
Abstract - Add to MetaCart
Abstract. We prove that the resonance counting functions for Schrödinger operators HV = − ∆ + V on L 2 (R d), for d ≥ 2 even, with generic, compactlysupported, real- or complex-valued potentials V, have the maximal order of growth d on each sheet Λm, m ∈ Z\{0}, of the logarithmic Riemann surface

Maximal order of growth for the resonance counting function for generic potentials in even dimensions, submitted

by T. J. Christiansen, P. D. Hislop
"... Abstract. We prove that the resonance counting functions for Schrödinger operators HV = − ∆ + V on L 2 (R d), for d ≥ 2 even, with generic, compactlysupported, real- or complex-valued potentials V, have the maximal order of growth d on each sheet Λm, m ∈ Z\{0}, of the logarithmic Riemann surface. We ..."
Abstract - Cited by 7 (6 self) - Add to MetaCart
Abstract. We prove that the resonance counting functions for Schrödinger operators HV = − ∆ + V on L 2 (R d), for d ≥ 2 even, with generic, compactlysupported, real- or complex-valued potentials V, have the maximal order of growth d on each sheet Λm, m ∈ Z\{0}, of the logarithmic Riemann surface

SCRIBE: The design of a large-scale event notification infrastructure

by Antony Rowstron, Anne-Marie Kermarrec, Miguel Castro, Peter Druschel - In Networked Group Communication , 2001
"... This paper presents Scribe, a large-scale event notification infrastructure for topic-based publish-subscribe applications. Scribe supports large numbers of topics, with a potentially large number of subscribers per topic. Scribe is built on top of Pastry, a generic peer-to-peer object location a ..."
Abstract - Cited by 344 (12 self) - Add to MetaCart
This paper presents Scribe, a large-scale event notification infrastructure for topic-based publish-subscribe applications. Scribe supports large numbers of topics, with a potentially large number of subscribers per topic. Scribe is built on top of Pastry, a generic peer-to-peer object location

Adaptive Duplicate Detection Using Learnable String Similarity Measures

by Mikhail Bilenko, Raymond J. Mooney - In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2003 , 2003
"... The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied on generic or manually tuned distance metrics for estimating the similarity of potential duplicates. In this paper, we p ..."
Abstract - Cited by 344 (14 self) - Add to MetaCart
The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied on generic or manually tuned distance metrics for estimating the similarity of potential duplicates. In this paper, we

Fields of experts: A framework for learning image priors

by Stefan Roth, Michael J. Black - In CVPR , 2005
"... We develop a framework for learning generic, expressive image priors that capture the statistics of natural scenes and can be used for a variety of machine vision tasks. The approach extends traditional Markov Random Field (MRF) models by learning potential functions over extended pixel neighborhood ..."
Abstract - Cited by 292 (4 self) - Add to MetaCart
We develop a framework for learning generic, expressive image priors that capture the statistics of natural scenes and can be used for a variety of machine vision tasks. The approach extends traditional Markov Random Field (MRF) models by learning potential functions over extended pixel
Results 1 - 10 of 3,859