Sciweavers

1289 search results - page 252 / 258
» Flexible Language Interoperability
Sort
View
ANCS
2007
ACM
13 years 11 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
ESWS
2007
Springer
13 years 11 months ago
Imprecise SPARQL: Towards a Unified Framework for Similarity-Based Semantic Web Tasks
This proposal explores a unified framework to solve Semantic Web tasks that often require similarity measures, such as RDF retrieval, ontology alignment, and semantic service match...
Christoph Kiefer
AIIA
2003
Springer
13 years 11 months ago
Applying Artificial Intelligence to Clinical Guidelines: The GLARE Approach
In this paper, we present GLARE, a domain-independent system for acquiring, representing and executing clinical guidelines. GLARE is characterized by the adoption of Artificial Int...
Paolo Terenziani, Stefania Montani, Alessio Bottri...
PARA
2000
Springer
13 years 11 months ago
Experiments in Separating Computational Algorithm from Program Distribution and Communication
Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yie...
Raphael B. Yehezkael, Yair Wiseman, H. G. Mendelba...
VLDB
1995
ACM
97views Database» more  VLDB 1995»
13 years 11 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch