ADVANCED SEARCH
Advanced Search
FEEDBACK
 Please provide us with feedback
Found 25,886 of 1,394,228
|
|
Results 1 - 20 of 25,886
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
1
|
|
System-wide compaction and specialization of the linux kernel
|
|
July 2005
|
|
LCTES '05: Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
|
Publisher: ACM
 Request Permissions
|
|
Full text available: |
 Pdf
(895.17 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 5, Downloads (12 Months): 44, Downloads (Overall): 524, Citation Count: 7 |
 |
|
The limited built-in configurability of Linux can lead to expensive code size overhead when it is used in the embedded market. To overcome this problem, we propose the application of link-time compaction and specialization techniques that exploit the ...
Keywords: compaction, linux kernel, operating system, specialization, system calls
|
Also published in: |
| July 2005 |
SIGPLAN Notices |
Volume 40 Issue 7 |
|
|
2
|
|
Coding schemes for chip-to-chip interconnect applications
|
|
April 2006
|
|
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
, Volume 14 Issue 4
|
|
Publisher: IEEE Educational Activities Department
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
Increasing demand for high-speed interchip interconnects requires faster links that consume less power. The Shannon limit for the capacity of these links is at least an order of magnitude higher than the data rate of the current state-of-the-art designs. ...
Keywords: chip-to-chip communications, coding, high speed, power efficient, signaling scheme
|
|
3
|
|
4
|
|
Orthogonal and projected orthogonal matched filter detection
|
|
April 2004
|
|
Signal Processing
, Volume 84 Issue 4
|
|
Publisher: Elsevier North-Holland, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
This paper considers the genetic problem of detecting in the presence of additive noise, which one from a set of known signals has been received. In place of the classical matched filter (MF) receiver we propose a modified receiver. When the transmitted ...
Keywords: MMSE whitening, least-squares orthogonalization, matched-filter detection, multi-signature detection, non-Gaussian noise
|
|
5
|
|
Editor's Note
|
|
June 2007
|
|
IEEE Transactions on Computers
, Volume 56 Issue 6
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
6
|
|
Optimizing Rekeying Cost for Contributory Group Key Agreement Schemes
|
|
July 2007
|
|
IEEE Transactions on Dependable and Secure Computing
, Volume 4 Issue 3
|
|
Publisher: IEEE Computer Society Press
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
While contributory group key agreement is a promising solution to achieve access control in collaborative and dynamic group applications, the existing schemes have not achieved the performance lower bound in terms of time, communication and computation ...
Keywords: Security, Key Management, Tree Structure
|
|
7
|
|
On weights in duadic Abelian codes
|
|
January 2003
|
|
Discrete Mathematics
, Volume 260 Issue 1-3
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
In this note, we prove that if C is a duadic binary abelian code with splitting µ = µ-1 and the minimum odd weight of C satisfies d2 - d + 1 ≠ n, then d(d-1) ≥ n + 11. We show by an example ...
Keywords: duadic abelian codes, group algebra, primitive idempotent, weight
|
|
8
|
|
9
|
|
A clique size bounding technique with application to non-linear codes
|
|
January 1999
|
|
SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
|
|
Publisher: Society for Industrial and Applied Mathematics
|
|
Full text available: |
Pdf
(184.51 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 2, Downloads (12 Months): 15, Downloads (Overall): 132, Citation Count: 0 |
|
|
|
|
|
10
|
|
11
|
|
CryptoManager++
|
|
December 1996
|
|
Information systems security
|
|
Publisher: Chapman & Hall, Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
Keywords: application programming interface, cryptographic library, object oriented programming
|
|
12
|
|
Bounded delay L codes
|
|
July 1991
|
|
Theoretical Computer Science
, Volume 84 Issue 2
|
|
Publisher: Elsevier Science Publishers Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
13
|
|
On Blind Timing Acquisition and Channel Estimation for Wideband Multiuser DS-CDMA Systems
|
|
February 2002
|
|
Journal of VLSI Signal Processing Systems
, Volume 30 Issue 1/3
|
|
Publisher: Kluwer Academic Publishers
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
The problems of blind timing acquisition and channel estimation for DS-CDMA signals in multipath fading channels are investigated. Using only the spreading code of the desired user, methods based on QR decompositions are proposed. These methods ...
Keywords: DS-CDMA, QR decompositions, blind algorithms, channel estimation, multipath fading, multiuser systems, synchronization, timing acquisition, wideband CDMA
|
|
14
|
|
On the average hamming distance for binary codes
|
|
December 1998
|
|
Discrete Applied Mathematics
, Volume 89 Issue 1-3
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
|
|
|
Keywords: Althöfer-Sillke inequality, MacWilliams-Delsarte identity, average Hamming distance, distance enumerator, variance of AHD
|
|
15
|
|
Second order systems for filtering and sampling methods
|
|
November 2008
|
|
MACMESE'08: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
|
|
Publisher: World Scientific and Engineering Academy and Society (WSEAS)
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
This paper presents some invariance properties of differential equations, used for generating truncated test-function (functions which differ from zero only on a certain interval and with only some derivatives f(1), f(2), ..f(n) ...
Keywords: differential equations, filtering and sampling, integration, random variations, second order oscillating systems, truncated test-function
|
|
16
|
|
Methods and design algorithms for predictive quantization of signals and images
|
|
January 2004
|
|
Methods and design algorithms for predictive quantization of signals and images
|
|
Publisher: University of Michigan
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
This dissertation is concerned with methods for predictive quantization of signals and images, as well as code design algorithms for these methods. Our first contribution is a careful treatment of the technique of deterministic annealing for entropy-constrained ...
|
|
17
|
|
Region representation: parallel connected stripes
|
|
November 1984
|
|
Computer Vision, Graphics, and Image Processing
, Volume 28 Issue 3
|
|
Publisher: Academic Press Professional, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
18
|
|
19
|
|
Indexing text using the Ziv-Lempel trie
|
|
March 2004
|
|
Journal of Discrete Algorithms
, Volume 2 Issue 1
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 9 |
|
|
Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv-Lempel trie, called the LZ-index, that takes 4n log2 ...
Keywords: compressed pattern matching, compressed text, self-indexing, succinct data structures
|
|
20
|
|
Should APL be a declining language?
|
|
October 1981
|
|
APL '81: Proceedings of the international conference on APL
|
|
Publisher: ACM
|
|
Full text available: |
Pdf
(516.41 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 5, Downloads (12 Months): 8, Downloads (Overall): 83, Citation Count: 12 |
|
|
The evolution of computer languages is compared with the evolution of natural languages. This suggests that APL might one day evolve to, or be replaced by, a non-declining form having only one basic syntax and only one class of object—as LISP has ...
|
Also published in: |
| September 1981 |
SIGAPL APL Quote Quad |
Volume 12 Issue 1 |
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Refine by Keywords
Save results to a Binder
Publisher Site