Sciweavers

2125 search results - page 376 / 425
» On Graph Complexity
Sort
View
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
13 years 8 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie
JAIR
2008
126views more  JAIR 2008»
13 years 8 months ago
Extended RDF as a Semantic Foundation of Rule Markup Languages
Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts based on base...
Anastasia Analyti, Grigoris Antoniou, Carlos Viega...
CORR
2007
Springer
177views Education» more  CORR 2007»
13 years 8 months ago
N3Logic: A Logical Framework For the World Wide Web
The Semantic Web drives towards the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the S...
Tim Berners-Lee, Dan Connolly, Lalana Kagal, Yosi ...
ISI
2006
Springer
13 years 8 months ago
Semantic Analytics Visualization
In this paper we present a new tool for semantic analytics through 3D visualization called "Semantic Analytics Visualization" (SAV). It has the capability for visualizing...
Leonidas Deligiannidis, Amit P. Sheth, Boanerges A...
LISP
2008
96views more  LISP 2008»
13 years 8 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal