Results 1 - 10 of 16,956

On The Extension Of P-Consistent Mappings

by L. Boyen, G. De Cooman, E. E. Kerre - Foundations and Applications of Possibility Theory , 1995
"... In this paper, the notion of P-consistency is extended to complete lattice-valued mappings. It is proven that a P-consistent mapping possesses a distribution if and only if it is extendable to a possibility measure defined on an ample field. A necessary and sufficient condition is given for extendab ..."
Abstract - Cited by 14 (13 self) - Add to MetaCart
In this paper, the notion of P-consistency is extended to complete lattice-valued mappings. It is proven that a P-consistent mapping possesses a distribution if and only if it is extendable to a possibility measure defined on an ample field. A necessary and sufficient condition is given

Globally Consistent Range Scan Alignment for Environment Mapping

by F. Lu, E. Milios - AUTONOMOUS ROBOTS , 1997
"... A robot exploring an unknown environmentmay need to build a world model from sensor measurements. In order to integrate all the frames of sensor data, it is essential to align the data properly. An incremental approach has been typically used in the past, in which each local frame of data is alig ..."
Abstract - Cited by 531 (8 self) - Add to MetaCart
is aligned to a cumulative global model, and then merged to the model. Because different parts of the model are updated independently while there are errors in the registration, such an approachmay result in an inconsistent model. In this paper, we study the problem of consistent registration of multiple

Learning globally consistent maps by relaxation

by Tom Duckett - In Proceedings of the IEEE International Conference on Robotics and Automation , 2000
"... Mobile robots require the ability to build their own maps to operate in unknown environments. A funda-mental problem is that odometry-based dead reckoning cannot be used to assign accurate global position infor-mation to a map because of drift errors caused by wheel slippage. This paper introduces a ..."
Abstract - Cited by 71 (4 self) - Add to MetaCart
a fast, on-line method of learning globally consistent maps, using only local metric information. The approach differs from previ-ous work in that it is computationally cheap, easy to implement and is guaranteed to find a globally optimal solution. Experiments are presented in which large, complex

The Structure-Mapping Engine: Algorithm and Examples

by Brian Falkenhainer, Kenneth D. Forbus, Dedre Gentner - Artificial Intelligence , 1989
"... This paper describes the Structure-Mapping Engine (SME), a program for studying analogical processing. SME has been built to explore Gentner's Structure-mapping theory of analogy, and provides a "tool kit" for constructing matching algorithms consistent with this theory. Its flexibili ..."
Abstract - Cited by 522 (116 self) - Add to MetaCart
This paper describes the Structure-Mapping Engine (SME), a program for studying analogical processing. SME has been built to explore Gentner's Structure-mapping theory of analogy, and provides a "tool kit" for constructing matching algorithms consistent with this theory. Its

Controlled and automatic human information processing

by Walter Schneider, Richard M. Shiffrin - I. Detection, search, and attention. Psychological Review , 1977
"... A two-process theory of human information processing is proposed and applied to detection, search, and attention phenomena. Automatic processing is activa-tion of a learned sequence of elements in long-term memory that is initiated by appropriate inputs and then proceeds automatically—without subjec ..."
Abstract - Cited by 874 (16 self) - Add to MetaCart
mechanisms. Automatic detection is shown to develop following consistent mapping of stimuli to responses over trials. Controlled search is utilized in varied-mapping paradigms, and in our studies, it takes the form of serial, terminating search. The approach resolves a number of apparent conflicts

Photo tourism: Exploring photo collections in 3D

by Noah Snavely, Steven M. Seitz, Richard Szeliski - IN PROC. ACM SIGGRAPH , 2006
"... We present a system for interactively browsing and exploring large unstructured collections of photographs of a scene using a novel 3D interface. Our system consists of an image-based modeling front end that automatically computes the viewpoint of each photograph as well as a sparse 3D model of th ..."
Abstract - Cited by 677 (37 self) - Add to MetaCart
We present a system for interactively browsing and exploring large unstructured collections of photographs of a scene using a novel 3D interface. Our system consists of an image-based modeling front end that automatically computes the viewpoint of each photograph as well as a sparse 3D model

The design and implementation of an intentional naming system

by William Adjie-Winoto, Elliot Schwartz, Hari Balakrishnan, Jeremy Lilley - 17TH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES (SOSP '99) PUBLISHED AS OPERATING SYSTEMS REVIEW, 34(5):186--201, DEC. 1999 , 1999
"... This paper presents the design and implementation of the Intentional Naming System (INS), a resource discovery and service location system for dynamic and mobile networks of devices and computers. Such environments require a naming system that is (i) expressive, to describe and make requests based o ..."
Abstract - Cited by 518 (14 self) - Add to MetaCart
.e., their intent), not where to find things (i.e., not hostnames). INS implements a late binding mechanism that integrates name resolution and message routing, enabling clients to continue communicating with end-nodes even if the name-to-address mappings change while a session is in progress. INS resolvers self

A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR PROGRAMMING

by N. Karmarkar - COMBINATORICA , 1984
"... We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract - Cited by 860 (3 self) - Add to MetaCart
the ellipsoid algorithm by a factor of O(n~'~). We prove that given a polytope P and a strictly in-terior point a E P, there is a projective transformation of the space that maps P, a to P', a ' having the following property. The ratio of the radius of the smallest sphere with center a

Fast, On-Line Learning of Globally Consistent Maps

by Tom Duckett, Stephen Marsland, Jonathan Shapiro , 2002
"... To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot be used to assign accurate global position information to a map because of cumulative drift errors. This paper introduce ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
introduces a fast, on-line algorithm for learning geometrically consistent maps using only local metric information. The algorithm works by using a relaxation technique to minimize an energy function over many small steps. The approach differs from previous work in that it is computationally cheap, easy

Myrinet: A Gigabit-per-Second Local Area Network

by Nanette J. Boden, Danny Cohen, Robert E. Felderman, Alan E. Kulawik, Charles L. Seitz, Jakov N. Seizovic, Wen-king Su - IEEE Micro , 1995
"... Abstract. Myrinet is a new type of local-area network (LAN) based on the technology used for packet communication and switching within "massivelyparallel processors " (MPPs). Think of Myrinet as an MPP message-passing network that can span campus dimensions, rather than as a wide-a ..."
Abstract - Cited by 1011 (0 self) - Add to MetaCart
that can map the network, select routes, and translate from network addresses to routes, as well as handle packet traffic; and (4) streamlined host software that allows direct communication between user processes and the network. Background. In order to understand how Myrinet differs from conventional LANs
Results 1 - 10 of 16,956