Sciweavers

7195 search results - page 548 / 1439
» On Computing Power
Sort
View
KI
2009
Springer
16 years 1 months ago
An Argumentation-Based Approach to Handling Inconsistencies in DL-Lite
As a tractable description logic, DL-Lite provides a good compromise between expressive power and computational complexity of inference. It is therefore important to study ways of ...
Xiaowang Zhang, Zuoquan Lin
NIPS
2004
15 years 8 months ago
Semi-supervised Learning on Directed Graphs
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...
Dengyong Zhou, Bernhard Schölkopf, Thomas Hof...
179
Voted
CDES
2008
90views Hardware» more  CDES 2008»
15 years 8 months ago
Nanocompilation for the Cell Matrix Architecture
- The Cell Matrix Architecture is a massive array of dynamically self-configurable, uniformly connected, identical computational units. This architecture can enable efficient, prac...
Thomas Way, Rushikesh Katikar, Ch. Purushotham
195
Voted
CONCUR
2008
Springer
15 years 8 months ago
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
In this paper, we present a unified approach to evaluating the relative expressive power of process calculi. In particular, we identify a small set of criteria (that have already b...
Daniele Gorla
326
Voted
SPAA
2012
ACM
13 years 9 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...