Sciweavers

9504 search results - page 27 / 1901
» Dynamic Substitution Model
Sort
View
ALGORITHMICA
1998
94views more  ALGORITHMICA 1998»
13 years 7 months ago
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
Philip N. Klein, Sairam Subramanian
IPPS
2006
IEEE
14 years 1 months ago
Elementary block based 2-dimensional dynamic and partial reconfiguration for Virtex-II FPGAs
The development of Field Programmable Gate Arrays (FPGAs) had tremendous improvements in the last few years. They were extended from simple logic circuits to complex Systems-on-Ch...
Michael Hübner, Christian Schuck, Jürgen...
ISSTA
2006
ACM
14 years 1 months ago
Towards an architectural approach for the dynamic and automatic composition of software components
In a component-based software system the components are specified, designed and implemented with the intention to be reused, and are assembled in various contexts in order to pro...
Antonio Bucchiarone, Andrea Polini, Patrizio Pelli...
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
COLING
2008
13 years 9 months ago
Sentence Compression Beyond Word Deletion
In this paper we generalise the sentence compression task. Rather than simply shorten a sentence by deleting words or constituents, as in previous work, we rewrite it using additi...
Trevor Cohn, Mirella Lapata