Sciweavers

2372 search results - page 176 / 475
» Probabilistic calling context
Sort
View
123
Voted
ICASSP
2010
IEEE
15 years 2 months ago
A robust minimum volume enclosing simplex algorithm for hyperspectral unmixing
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...
Arul-Murugan Ambikapathi, Tsung-Han Chan, Wing-Kin...
117
Voted
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 2 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
STTT
2008
90views more  STTT 2008»
15 years 2 months ago
A uniform framework for weighted decision diagrams and its implementation
1 This papers introduces a generic framework for OBDD variants with weighted edges. It covers many boolean and multi-valued OBDD-variants that have been studied in the literature a...
Jörn Ossowski, Christel Baier
107
Voted
ECTEL
2007
Springer
15 years 8 months ago
Applying Sensemaking in a Mobile Learning Scenario
In this work, a new type of collaborative learning activity is proposed in order to enable students to explore and understand information in highly mobile situations. We call this ...
Gustavo Zurita, Nelson Baloian, Pedro Antunes, Fel...
SGAI
2007
Springer
15 years 8 months ago
Learning Sets of Sub-Models for Spatio-Temporal Prediction
In this paper we describe a novel technique which implements a spatiotemporal model as a set of sub-models based on first order logic. These sub-models model different, typicall...
Andrew Bennett, Derek R. Magee