Sciweavers

570 search results - page 31 / 114
» On the number of zero-sum subsequences
Sort
View
CPM
2001
Springer
108views Combinatorics» more  CPM 2001»
14 years 2 months ago
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
Anne Bergeron
IICS
2001
Springer
14 years 2 months ago
Hardware Security Concept for Spontaneous Network Integration of Mobile Devices
In this article we introduce an architecture of a mobile device that enables safe and authenticated data-transmission in a spontaneously configured network environment. The usage ...
Igor Sedov, Marc Haase, Clemens H. Cap, Dirk Timme...
ICDCS
1999
IEEE
14 years 2 months ago
Scalable Processing of Read-Only Transactions in Broadcast Push
Recently, push-based delivery has attracted considerable attention as a means of disseminating information to large client populations in both wired and wireless settings. In this...
Evaggelia Pitoura, Panos K. Chrysanthis
ISSS
1996
IEEE
114views Hardware» more  ISSS 1996»
14 years 2 months ago
Flow Graph Balancing for Minimizing the Required Memory Bandwidth
In this paper we present the problem of flow graph balancing for minimizingthe required memory bandwidth. Our goal is to minimize the required memory bandwidth within the given cy...
Sven Wuytack, Francky Catthoor, Gjalt G. de Jong, ...
DAC
1993
ACM
14 years 2 months ago
On Area/Depth Trade-off in LUT-Based FPGA Technology Mapping
In this paper we study the area and depth trade-off in LUT based FPGA technology mapping. Starting from a depth-optimal mapping solution, we perform a number of depth relaxation o...
Jason Cong, Yuzheng Ding