Sciweavers

16404 search results - page 436 / 3281
» A set coverage problem
Sort
View
180
Voted
RIAO
2004
15 years 8 months ago
An Experiment with Ontology Mapping using Concept Similarity
This paper describes a system for automatically mapping between concepts in different ontologies. The motivation for the research stems from the Diogene project, in which the proj...
Robert Villa, Ruth Wilson, Fabio Crestani
ACL
1998
15 years 8 months ago
Building Accurate Semantic Taxonomies from Monolingual MRDs
This paper presents a method that conbines a set of unsupervised algorithms in order to accurately build large taxonomies from any machine-readable dictionary (MRD). Our aim is to...
German Rigau, Eneko Agirre
ICECCS
2010
IEEE
120views Hardware» more  ICECCS 2010»
15 years 7 months ago
Maintaining Stable Node Populations in Long-Lifetime Sensornets
Sensornets provide coverage of physical phenomena over extended periods, perhaps months or years. However, active nodes may deplete finite batteries within days, and are prone to...
Jonathan Tate, Iain Bate
DSS
2006
91views more  DSS 2006»
15 years 6 months ago
Matching information security vulnerabilities to organizational security profiles: a genetic algorithm approach
Organizations are making substantial investments in information security to reduce the risk presented by vulnerabilities in their information technology (IT) infrastructure. Howev...
Mukul Gupta, Jackie Rees, Alok R. Chaturvedi, Jie ...
IJAHUC
2008
118views more  IJAHUC 2008»
15 years 6 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani