Sciweavers

3220 search results - page 118 / 644
» Constrained Graph Processes
Sort
View
AAAI
2008
15 years 8 days ago
Efficient Optimization of Information-Theoretic Exploration in SLAM
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
Thomas Kollar, Nicholas Roy
TMI
2010
164views more  TMI 2010»
14 years 4 months ago
Robust Reconstruction of MRSI Data Using a Sparse Spectral Model and High Resolution MRI Priors
We introduce a novel algorithm to address the challenges in magnetic resonance (MR) spectroscopic imaging. In contrast to classical sequential data processing schemes, the proposed...
Ramin Eslami, Mathews Jacob
ICCS
1997
Springer
15 years 2 months ago
Applying Conceptual Graph Theory to the User-Driven Specification of Network Information Systems
Users need to be strongly involved in the specification process of network information systems. Characteristics of user-driven specification are described, and process composition ...
Aldo de Moor
IWINAC
2005
Springer
15 years 3 months ago
Self Assembling Graphs
A self-assembly algorithm for synchronising agents and have them arrange according to a particular graph is given. This algorithm, expressed using an ad hoc rule-based process alge...
Vincent Danos, Fabien Tarissan
NAACL
2007
14 years 11 months ago
Data-Driven Graph Construction for Semi-Supervised Graph-Based Learning in NLP
Graph-based semi-supervised learning has recently emerged as a promising approach to data-sparse learning problems in natural language processing. All graph-based algorithms rely ...
Andrei Alexandrescu, Katrin Kirchhoff