Sciweavers

378 search results - page 19 / 76
» How Many Ways Can One Draw a Graph
Sort
View
115
Voted
BXML
2004
15 years 5 months ago
Trust and context using the RDF-Source related Storage System (RDF-S3) and easy RQL (eRQL)
Abstract. There exist different ways how to understand and use context information for RDF data. This paper summarizes these different ways and concentrates on the source informati...
Karsten Tolle, Fabian Wleklinski
152
Voted
DAARC
2007
Springer
137views Algorithms» more  DAARC 2007»
15 years 9 months ago
Anaphora Resolution as Equality by Default
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
Ariel Cohen
133
Voted
HT
2005
ACM
15 years 9 months ago
Mind the semantic gap
Hypertext can be seen as a logic representation, where semantics are encoded in both the textual nodes and the graph of links. Systems that have a very formal representation of th...
David E. Millard, Nicholas Gibbins, Danius T. Mich...
110
Voted
BMCBI
2010
143views more  BMCBI 2010»
15 years 3 months ago
An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location inf
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
Kaname Kojima, Masao Nagasaki, Satoru Miyano
173
Voted
PODC
2011
ACM
14 years 6 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela