1736 search results - page 339 / 348 » The rank-width of Directed Graphs |
112
Voted
KDD
2010
ACM
15 years 4 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
142
click to vote
ERSHOV
2009
Springer
15 years 4 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
108
click to vote
ICAIL
2007
ACM
15 years 4 months ago
2007
ACM
Legal-RDF.org1 publishes a practical ontology that models both the layout and content of a document and metadata about the document; these have been built using data models implici...
SPAA
1997
ACM
15 years 4 months ago
1997
ACM
A parallel multithreaded program that is ostensibly deterministic may nevertheless behave nondeterministically due to bugs in the code. These bugs are called determinacy races, an...
120
click to vote
ESWS
2008
Springer
15 years 2 months ago
2008
Springer
In this contribution a system is presented, which provides access to distributed data sources using Semantic Web technology. While it was primarily designed for data sharing and sc...