Sciweavers

553 search results - page 41 / 111
» Cover Contact Graphs
Sort
View
CONEXT
2007
ACM
15 years 2 months ago
The diameter of opportunistic mobile networks
Portable devices have more data storage and increasing communication capabilities everyday. In addition to classic infrastructure based communication, these devices can exploit hu...
Augustin Chaintreau, Abderrahmen Mtibaa, Laurent M...
SAMT
2009
Springer
180views Multimedia» more  SAMT 2009»
15 years 5 months ago
RelFinder: Revealing Relationships in RDF Knowledge Bases
Abstract. The Semantic Web has recently seen a rise of large knowledge bases (such as DBpedia) that are freely accessible via SPARQL endpoints. The structured representation of the...
Philipp Heim, Sebastian Hellmann, Jens Lehmann, St...
COCOON
2005
Springer
15 years 4 months ago
Power Domination Problem in Graphs
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
Chung-Shou Liao, Der-Tsai Lee
JSYML
2010
95views more  JSYML 2010»
14 years 5 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
ACL
1998
14 years 12 months ago
Time Mapping with Hypergraphs
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
Jan W. Amtrup, Volker Weber