Sciweavers

3844 search results - page 318 / 769
» Modular interpreted systems
Sort
View
FPCA
1989
15 years 8 months ago
Automatic Complexity Analysis
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
Mads Rosendahl
137
Voted
FCCM
2004
IEEE
144views VLSI» more  FCCM 2004»
15 years 8 months ago
Efficient Execution of Process Networks on a Reconfigurable Hardware Virtual Machine
In this paper we present a novel use of an FPGA as a computing element for streaming based application. We investigate the virtualized execution of dynamic reconfigurable tasks. We...
Matthias Dyer, Marco Platzner, Lothar Thiele
133
Voted
DMIN
2006
113views Data Mining» more  DMIN 2006»
15 years 6 months ago
Performance Evaluation of Two Data Mining Techniques of Network Alarms Analysis
In large telecommunication networks, alarms are usually useful for identifying faults and, therefore solving them. However, for large systems the number of alarms produced is so la...
Jacques-H. Bellec, M. Tahar Kechadi, Joe Carthy
ECSCW
2001
15 years 6 months ago
Creating coherent environments for collaboration
Drawing on studies of experimental systems and everyday settings we explore the relationship between social interaction and its environment. We show how interaction is inextricably...
Christian Heath, Paul Luff, Hideaki Kuzuoka, Keiic...
COLING
1996
15 years 6 months ago
Compositional Semantics in Verbmobil
The paper discusses how compositional semantics is implemented in the Verbmobil speech-to-speech translation system using LUD, a description language for underspecified discourse ...
Johan Bos, Björn Gambäck, Christian Lies...