Sciweavers

5158 search results - page 738 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
ICALP
2000
Springer
15 years 10 months ago
Generating Partial and Multiple Transversals of a Hypergraph
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
200
Voted
MICCAI
1998
Springer
15 years 10 months ago
The Correlation Ratio as a New Similarity Measure for Multimodal Image Registration
Over the last five years, new "voxel-based" approaches have allowed important progress in multimodal image registration, notably due to the increasing use of information-...
Alexis Roche, Grégoire Malandain, Xavier Pe...
ZUM
2000
Springer
15 years 10 months ago
Retrenchment, Refinement, and Simulation
: Retrenchment is introduced as a liberalisation of refinement intended to address some of the shortcomings of refinement as sole means of progressing from simple abstract models t...
Richard Banach, Michael Poppleton
HYBRID
1995
Springer
15 years 10 months ago
Supervisory Control of Real-Time Systems Using Prioritized Synchronization
The theory of supervisory control of discrete event systems is extended to the real-time setting. The real-time behavior of a system is represented by the set of all possible time...
Ratnesh Kumar, Mark A. Shayman
LICS
1997
IEEE
15 years 10 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...