Sciweavers

1461 search results - page 212 / 293
» Complexity of Graph Covering Problems
Sort
View
COSIT
2003
Springer
132views GIS» more  COSIT 2003»
14 years 2 months ago
"Simplest" Paths: Automated Route Selection for Navigation
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
Matt Duckham, Lars Kulik
DIS
2009
Springer
14 years 23 days ago
Discovering Influential Nodes for SIS Models in Social Networks
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
IJNM
2000
91views more  IJNM 2000»
13 years 8 months ago
Coding-based schemes for fault identification in communication networks
The complexity of communication networks and the amount of information transferred in these networks have made the management of such networks increasingly difficult. Since faults ...
Chi-Chun Lo, Shing Hong Chen, Bon-Yeh Lin
COMGEO
2006
ACM
13 years 9 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
ESWS
2009
Springer
14 years 3 months ago
Evolva: A Comprehensive Approach to Ontology Evolution
Ontology evolution is increasingly gaining momentum in the area of Semantic Web research. Current approaches target the evolution in terms of either content, or change management, ...
Fouad Zablith