Sciweavers

5378 search results - page 1056 / 1076
» Base Logics in Argumentation
Sort
View
SIGIR
1998
ACM
14 years 26 days ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
ECOOPW
1998
Springer
14 years 26 days ago
Mapping Business Processes to Software Design Artifacts
This paper explains the structure of a project repository, which enables you to trace business processes and business rules to the architecture and design of the software system. T...
Pavel Hruby
FCCM
1997
IEEE
199views VLSI» more  FCCM 1997»
14 years 26 days ago
The RAW benchmark suite: computation structures for general purpose computing
The RAW benchmark suite consists of twelve programs designed to facilitate comparing, validating, and improving reconfigurable computing systems. These benchmarks run the gamut o...
Jonathan Babb, Matthew Frank, Victor Lee, Elliot W...
ICCAD
1997
IEEE
69views Hardware» more  ICCAD 1997»
14 years 26 days ago
Speeding up technology-independent timing optimization by network partitioning
Technology-independenttimingoptimizationis animportantproblem in logic synthesis. Although many promising techniques have been proposed in the past, unfortunately they are quite s...
Rajat Aggarwal, Rajeev Murgai, Masahiro Fujita
DAC
1997
ACM
14 years 25 days ago
Static Timing Analysis of Embedded Software
This paper examines the problem of statically analyzing the performance of embedded software. This problem is motivated by the increasing growth of embedded systems and a lack of ...
Sharad Malik, Margaret Martonosi, Yau-Tsun Steven ...
« Prev « First page 1056 / 1076 Last » Next »