Sciweavers

11565 search results - page 112 / 2313
» Computing Minimal Mappings
Sort
View
DSS
2006
116views more  DSS 2006»
15 years 4 months ago
Matching knowledge elements in concept maps using a similarity flooding algorithm
Concept mapping systems used in education and knowledge management emphasize flexibility of representation to enhance learning and facilitate knowledge capture. Collections of con...
Byron Marshall, Hsinchun Chen, Therani Madhusudan
79
Voted
DCC
2006
IEEE
16 years 3 months ago
A Flaw in the Use of Minimal Defining Sets for Secret Sharing Schemes
It is shown that in some cases it is possible to reconstruct a block design D uniquely from incomplete knowledge of a minimal defining set for D. This surprising result has implic...
Mike J. Grannell, Terry S. Griggs, Anne Penfold St...
124
Voted
FOSSACS
2009
Springer
15 years 10 months ago
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
Parosh Aziz Abdulla, Richard Mayr
EMMCVPR
1997
Springer
15 years 8 months ago
An Energy Minimization Method for Matching and Comparing Structured Object Representations
We present a general method for matching segmented parts of objects by energy minimization. The energy is designed in order to cope with possible imperfections of the compared segm...
Robert Azencott, Laurent Younes
CIE
2006
Springer
15 years 7 months ago
The Jump Classes of Minimal Covers
We work in D[< 0 ]. Given the jump class of any (Turing) degree a, the jump classes of the minimal covers of a is a matter which is entirely settled unless a is high2. We show t...
Andrew E. M. Lewis