Sciweavers

5639 search results - page 459 / 1128
» Timed Abstract Non-interference
Sort
View
DCC
2006
IEEE
16 years 4 months ago
Compressed Data Structures: Dictionaries and Data-Aware Measures
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Sco...
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
15 years 11 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
ICC
2007
IEEE
110views Communications» more  ICC 2007»
15 years 11 months ago
A New STC Structure to Achieve Generalized Optimal Diversity with a Reduced Design Complexity
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
Moon Il Lee, Seong Keun Oh, Dong Seung Kwon
FDL
2005
IEEE
15 years 10 months ago
Mixing Synchronous Reactive and Untimed Models of Computation
The support of heterogeneity at the specification level, that is, the ability to mix several models of computation (MoCs) in the system-level specification, is becoming increasing...
Fernando Herrera, Eugenio Villar
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
15 years 10 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...