Results 1 - 10 of 15,357

A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots

by Sebastian Thrun, Wolfram Burgard, Dieter Fox, Henry Hexmoor, Maja Mataric - Machine Learning , 1998
"... . This paper addresses the problem of building large-scale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximum-likelihood estimation problem. It then devises a practical algorithm for generating the most likely map from ..."
Abstract - Cited by 483 (43 self) - Add to MetaCart
. This paper addresses the problem of building large-scale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximum-likelihood estimation problem. It then devises a practical algorithm for generating the most likely map from

On McMullen-like mappings

by Antonio Garijo, Sébastien Godillon , 2014
"... We introduce a generalization of the McMullen family fλ(z) = zn + λ/zd. In 1988 C. McMullen showed that the Julia set of fλ is a Cantor set of circles if and only if 1/n+1/d < 1 and the simple critical values of fλ belong to the trap door. We generalize this behavior and we define a McMullen-lik ..."
Abstract - Add to MetaCart
at the origin that maps to infinity with local degree d. As in the McMullen family fλ, we can characterize a McMullen-like mapping using an arithmetic condition depending only on the polynomial P and the pole data D. We prove that the arithmetic condition is necessary using the theory of Thurston’s obstructions

Ontology Mapping: The State of the Art

by Yannis Kalfoglou, Marco Schorlemmer , 2003
"... Ontology mapping is seen as a solution provider in today's landscape of ontology research. As the number of ontologies that are made publicly available and accessible on the Web increases steadily, so does the need for applications to use them. A single ontology is no longer enough to support t ..."
Abstract - Cited by 446 (10 self) - Add to MetaCart
the tasks envisaged by a distributed environment like the Semantic Web. Multiple ontologies need to be accessed from several applications. Mapping could provide a common layer from which several ontologies could be accessed and hence could exchange information in semantically sound manners. Developing

A Scalable Content-Addressable Network

by Sylvia Ratnasamy , Paul Francis, Mark Handley, Richard Karp, Scott Shenker - IN PROC. ACM SIGCOMM 2001 , 2001
"... Hash tables – which map “keys ” onto “values” – are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed infra ..."
Abstract - Cited by 3371 (32 self) - Add to MetaCart
Hash tables – which map “keys ” onto “values” – are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed

Efficient semantic matching

by Fausto Giunchiglia, Mikalai Yatskevich, Enrico Giunchiglia , 2004
"... We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract - Cited by 855 (68 self) - Add to MetaCart
We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes

Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images.

by Stuart Geman , Donald Geman - IEEE Trans. Pattern Anal. Mach. Intell. , 1984
"... Abstract-We make an analogy between images and statistical mechanics systems. Pixel gray levels and the presence and orientation of edges are viewed as states of atoms or molecules in a lattice-like physical system. The assignment of an energy function in the physical system determines its Gibbs di ..."
Abstract - Cited by 5126 (1 self) - Add to MetaCart
Abstract-We make an analogy between images and statistical mechanics systems. Pixel gray levels and the presence and orientation of edges are viewed as states of atoms or molecules in a lattice-like physical system. The assignment of an energy function in the physical system determines its Gibbs

Mean shift, mode seeking, and clustering

by Yizong Cheng - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1995
"... Mean shift, a simple iterative procedure that shifts each data point to the average of data points in its neighborhood, is generalized and analyzed in this paper. This generalization makes some k-means like clustering algorithms its special cases. It is shown that mean shift is a mode-seeking proce ..."
Abstract - Cited by 624 (0 self) - Add to MetaCart
Mean shift, a simple iterative procedure that shifts each data point to the average of data points in its neighborhood, is generalized and analyzed in this paper. This generalization makes some k-means like clustering algorithms its special cases. It is shown that mean shift is a mode

A Model of Saliency-based Visual Attention for Rapid Scene Analysis

by Laurent Itti, Christof Koch, Ernst Niebur , 1998
"... A visual attention system, inspired by the behavior and the neuronal architecture of the early primate visual system, is presented. Multiscale image features are combined into a single topographical saliency map. A dynamical neural network then selects attended locations in order of decreasing salie ..."
Abstract - Cited by 1748 (72 self) - Add to MetaCart
A visual attention system, inspired by the behavior and the neuronal architecture of the early primate visual system, is presented. Multiscale image features are combined into a single topographical saliency map. A dynamical neural network then selects attended locations in order of decreasing

Factoring wavelet transforms into lifting steps

by Ingrid Daubechies, Wim Sweldens - J. FOURIER ANAL. APPL , 1998
"... This paper is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This decompositio ..."
Abstract - Cited by 584 (8 self) - Add to MetaCart
in the biorthogonal, i.e, non-unitary case. Like the lattice factorization, the decomposition presented here asymptotically reduces the computational complexity of the transform by a factor two. It has other applications, such as the possibility of defining a wavelet-like transform that maps integers to integers.

Alternative isoform regulation in human tissue transcriptomes

by Eric T. Wang, Rickard S, Shujun Luo, Irina Khrebtukova, Lu Zhang, Christine Mayr, Stephen F. Kingsmore, Gary P. Schroth, Christopher B. Burge - Nature , 2008
"... Through alternative processing of pre-mRNAs, individual mammalian genes often produce multiple mRNA and protein isoforms that may have related, distinct or even opposing functions. Here we report an in-depth analysis of 15 diverse human tissue and cell line transcriptomes based on deep sequencing of ..."
Abstract - Cited by 545 (6 self) - Add to MetaCart
of cDNA fragments, yielding a digital inventory of gene and mRNA isoform expression. Analysis of mappings of sequence reads to exon-exon junctions indicated that 92-94% of human genes undergo alternative splicing (AS), ∼86 % with a minor isoform frequency of 15% or more. Differences in isoform
Results 1 - 10 of 15,357