Sciweavers

594 search results - page 26 / 119
» A Note on Concepts and Distances
Sort
View
ESE
2000
102views Database» more  ESE 2000»
13 years 7 months ago
Picking the Right Problem Frame-An Empirical Study
Problem frames are a relatively new approach to requirements engineering, promising benefits not only in elicitation but also in subsequent design, by allowing their users to selec...
Keith Phalp, Karl Cox
CSREAPSC
2006
13 years 9 months ago
An Inexact Matching Method Based on Ontology and Semantic Distance for Resource Discovery and Interaction
- To overcome shortcomings of Exact Matching Method (EMM) and Substitute Description Method (SDM), an Inexact Matching Method Based on Ontology and Semantic Distance (OSDIMM) is in...
Tang Shancheng, Qian Yi, Wang Wei
ISCI
2007
170views more  ISCI 2007»
13 years 7 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
COMBINATORICS
2000
138views more  COMBINATORICS 2000»
13 years 7 months ago
Quasi-Spectral Characterization of Strongly Distance-Regular Graphs
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
Miguel Angel Fiol
RFIDSEC
2010
13 years 6 months ago
The Poulidor Distance-Bounding Protocol
RFID authentication protocols are susceptible to different types of relay attacks such as mafia and distance frauds. A countermeasure against these types of attacks are the well-...
Rolando Trujillo-Rasua, Benjamin Martin 0002, Gild...