Results 1  10
of
15,237
Pastry: Scalable, distributed object location and routing for largescale peertopeer systems
, 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for widearea peertopeer applications. Pastry provides applicationlevel routing and object location in a potentially very large overlay network of nodes connected via the Internet. ..."
Abstract

Cited by 2063 (50 self)
 Add to MetaCart
This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for widearea peertopeer applications. Pastry provides applicationlevel routing and object location in a potentially very large overlay network of nodes connected via the Internet. It can be used to support a wide range of peertopeer applications like global data storage, global data sharing, and naming. An insert operation in Pastry stores an object at a userdefined number of diverse nodes within the Pastry network. A lookup operation reliably retrieves a copy of the requested object if one exists. Moreover, a lookup is usually routed to the node nearest the client issuing the lookup (by some measure of proximity), among the nodes storing the requested object. Pastry is completely decentralized, scalable, and selfconfiguring; it automatically adapts to the arrival, departure and failure of nodes. Experimental results obtained with a prototype implementation on a simulated network of 100,000 nodes confirm Pastry's scalability, its ability to selfconfigure and adapt to node failures, and its good network locality properties.
Modeling and simulation of genetic regulatory systems: A literature review
 JOURNAL OF COMPUTATIONAL BIOLOGY
, 2002
"... In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The regulation of gene expression is achieved through genetic regulatory systems structured by networks of interactions between ..."
Abstract

Cited by 729 (15 self)
 Add to MetaCart
In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The regulation of gene expression is achieved through genetic regulatory systems structured by networks of interactions between DNA, RNA, proteins, and small molecules. As most genetic regulatory networks of interest involve many components connected through interlocking positive and negative feedback loops, an intuitive understanding of their dynamics is hard to obtain. As a consequence, formal methods and computer tools for the modeling and simulation of genetic regulatory networks will be indispensable. This paper reviews formalisms that have been employed in mathematical biology and bioinformatics to describe genetic regulatory systems, in particular directed graphs, Bayesian networks, Boolean networks and their generalizations, ordinary and partial differential equations, qualitative differential equations, stochastic equations, and rulebased formalisms. In addition, the paper discusses how these formalisms have been used in the simulation of the behavior of actual regulatory systems.
How to do xtabond2: An introduction to “Difference” and “System” GMM in Strata
 CENTER FOR GLOBAL DEVELOPMENT, WORKING PAPER NO. 103
, 2006
"... ..."
Equivariant Adaptive Source Separation
 IEEE Trans. on Signal Processing
, 1996
"... Source separation consists in recovering a set of independent signals when only mixtures with unknown coefficients are observed. This paper introduces a class of adaptive algorithms for source separation which implements an adaptive version of equivariant estimation and is henceforth called EASI (Eq ..."
Abstract

Cited by 448 (9 self)
 Add to MetaCart
Source separation consists in recovering a set of independent signals when only mixtures with unknown coefficients are observed. This paper introduces a class of adaptive algorithms for source separation which implements an adaptive version of equivariant estimation and is henceforth called EASI (Equivariant Adaptive Separation via Independence) . The EASI algorithms are based on the idea of serial updating: this specific form of matrix updates systematically yields algorithms with a simple, parallelizable structure, for both real and complex mixtures. Most importantly, the performance of an EASI algorithm does not depend on the mixing matrix. In particular, convergence rates, stability conditions and interference rejection levels depend only on the (normalized) distributions of the source signals. Close form expressions of these quantities are given via an asymptotic performance analysis. This is completed by some numerical experiments illustrating the effectiveness of the proposed ap...
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
, 1993
"... We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximated in Euclidian space, or where the dimensionality of a Euclidian representation is very high. Also relevant are highdim ..."
Abstract

Cited by 356 (5 self)
 Add to MetaCart
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximated in Euclidian space, or where the dimensionality of a Euclidian representation is very high. Also relevant are high
Evaluating Color Descriptors for Object and Scene Recognition
, 2010
"... Image category recognition is important to access visual information on the level of objects and scene types. So far, intensitybased descriptors have been widely used for feature extraction at salient points. To increase illumination invariance and discriminative power, color descriptors have been ..."
Abstract

Cited by 409 (32 self)
 Add to MetaCart
Image category recognition is important to access visual information on the level of objects and scene types. So far, intensitybased descriptors have been widely used for feature extraction at salient points. To increase illumination invariance and discriminative power, color descriptors have been proposed. Because many different descriptors exist, a structured overview is required of color invariant descriptors in the context of image category recognition. Therefore, this paper studies the invariance properties and the distinctiveness of color descriptors (software to compute the color descriptors from this paper is available from
Euclidian constraints for uncalibrated reconstruction
 In Proceedings Fourth International Conference on Computer Vision
, 1993
"... It is possible to recouer the threedimensional structure of a scene using images taken with ancalibrated cameras and pixel correspondences between these images. But such reconstruction can only be performed up to a projective transformation of the SD space. Therefore constraints have to be put on t ..."
Abstract

Cited by 40 (5 self)
 Add to MetaCart
It is possible to recouer the threedimensional structure of a scene using images taken with ancalibrated cameras and pixel correspondences between these images. But such reconstruction can only be performed up to a projective transformation of the SD space. Therefore constraints have to be put on the reconstructed data in order to gel the reconstruction in the euclidean space. Such constraints arise from knowledge of the scene: location of points, geometrical constraints on lines, etc. We discuss here the kind of constraints that have to be added and show how they can be fed in a general fmmework. Experimental results on real data prove the feasability, and experiments on simulated data address the accuracy of the results. 1
A review of algebraic multigrid
, 2001
"... Since the early 1990s, there has been a strongly increasing demand for more efficient methods to solve large sparse, unstructured linear systems of equations. For practically relevant problem sizes, classical onelevel methods had already reached their limits and new hierarchical algorithms had to b ..."
Abstract

Cited by 345 (11 self)
 Add to MetaCart
to be developed in order to allow an efficient solution of even larger problems. This paper gives a review of the first hierarchical and purely matrixbased approach, algebraic multigrid (AMG). AMG can directly be applied, for instance, to efficiently solve various types of elliptic partial differential equations
on Euclidian Domains and Surfaces
"... � Vector � field visualization is an � important topic in scientific visualization. Its aim is � � to � graphically represent field � data on � two and threedimensional � domains � and � on surfaces in an intuitiv � ely under� standable way. Here a � new � approach based on anisotropic nonlinear ..."
Abstract
 Add to MetaCart
� Vector � field visualization is an � important topic in scientific visualization. Its aim is � � to � graphically represent field � data on � two and threedimensional � domains � and � on surfaces in an intuitiv � ely under� standable way. Here a � new � approach based on anisotropic nonlinear diffusion is introduced. � � It enables an easy perception of vector field � data � and � serv � es as an � appropriate scale space method for � the vi� sualization of complicated flow � pattern. The approach is closely � related to nonlinear diffusion methods in image analysis where images � are � smoothed � while still � retaining and � enhancing edges. Here an � initial noisy image intensity is smoothed along � integral lines, whereas the image is sharpened in the orthogonal direction. The method is based on � a continuous model and requires the solution of a parabolic PDE problem. It is � discretized only in the final implementational step. Therefore, many � � important qualitativ � � e aspects can already be discussed on � a continuous lev � � el. Applications are shown for flow fields in 2D and 3D as � well as � for principal direc� tions � of � curvature on general triangulated surfaces. Furthermore the provisions for flow � segmentation are outlined.
transformations of the Euclidian space
, 1999
"... A remark about the Lie algebra of infinitesimal conformal ..."
Results 1  10
of
15,237