Sciweavers

1912 search results - page 190 / 383
» On the evaluation of argumentation formalisms
Sort
View
KCAP
2005
ACM
16 years 2 days ago
Relaxed Precision and Recall for Ontology Matching
In order to evaluate the performance of ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results. The most prominent criteria ...
Marc Ehrig, Jérôme Euzenat
BNCOD
2008
129views Database» more  BNCOD 2008»
15 years 8 months ago
A Semantics for a Query Language over Sensors, Streams and Relations
Abstract. We introduce a query language over sensors, streams and relations and formally describe its semantics. Although the language was specifically designed for sensor network ...
Christian Y. A. Brenninkmeijer, Ixent Galpin, Alva...
CGF
2010
118views more  CGF 2010»
15 years 6 months ago
The Readability of Path-Preserving Clusterings of Graphs
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...

Book
537views
17 years 4 months ago
How to Think Like a Computer Scientist: Java Version
""The goal of this book is to teach you to think like a computer scientist. I like the way computer scientists think because they combine some of the best features of Mat...
Allen B. Downey

Book
1497views
17 years 4 months ago
How to Think Like a Computer Scientist: C++ Version
"The goal of this book is to teach you to think like a computer scientist. I like the way computer scientists think because they combine some of the best features of Mathemati...
Allen B. Downey