Sciweavers

1671 search results - page 320 / 335
» On the Covering Steiner Problem
Sort
View
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 4 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
SEMWEB
2005
Springer
14 years 4 months ago
Modeling Degrees of Conceptual Overlap in Semantic Web Ontologies
Information retrieval systems have to deal with uncertain knowledge and query results should reflect this uncertainty in some manner. However, Semantic Web ontologies are based on...
Markus Holi, Eero Hyvönen
TABLEAUX
2005
Springer
14 years 4 months ago
A Tableau-Based Explainer for DL Subsumption
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
Thorsten Liebig, Michael Halfmann
IUI
2004
ACM
14 years 4 months ago
Sheepdog: learning procedures for technical support
Technical support procedures are typically very complex. Users often have trouble following printed instructions describing how to perform these procedures, and these instructions...
Tessa A. Lau, Lawrence D. Bergman, Vittorio Castel...
ICDAR
2003
IEEE
14 years 4 months ago
A Constraint-based Approach to Table Structure Derivation
er presents an approach to deriving an abstract geometric model of a table from a physical representation. The technique developed uses a graph of constraints between cells which ...
Matthew Hurst