Sciweavers

961 search results - page 63 / 193
» An Algorithm for Computing Semi-stable Semantics
Sort
View
AINA
2010
IEEE
15 years 1 months ago
YASA-M: A Semantic Web Service Matchmaker
Abstract--In this paper, we present new algorithms for matching Web services described in YASA4WSDL (YASA for short). We have already defined YASA that overcomes some issues missin...
Yassin Chabeb, Samir Tata, Alain Ozanne
CVPR
2010
IEEE
15 years 5 months ago
Detecting and Parsing Architecture at City Scale from Range Data
We present a method for detecting and parsing buildings from unorganized 3D point clouds into a compact, hierarchical representation that is useful for high-level tasks. The input...
Alexander Toshev, Philippos Mordohai, Ben Taskar
WWW
2008
ACM
15 years 10 months ago
Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the web
Easy reuse and integration of declaratively described information in a distributed setting is one of the main motivations for building the Semantic Web. Despite of this claim, reu...
Simon Schenk, Steffen Staab
FMICS
2007
Springer
15 years 4 months ago
An Approach to Formalization and Analysis of Message Passing Libraries
Message passing using libraries implementing the Message Passing Interface (MPI) standard is the dominant communication mechanism in high performance computing (HPC) applications. ...
Robert Palmer, Michael Delisi, Ganesh Gopalakrishn...
LPNMR
1997
Springer
15 years 1 months ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian