Sciweavers

1017 search results - page 25 / 204
» Register computations on ordinals
Sort
View

Publication
334views
15 years 7 months ago
ANONAGGREGATE: Anonymizing Data Using Sequential Aggregation
We propose a methodology for anonymization of records by aggregating sequential records. This methodology is applied to real valued, binary, nominal and ordinal data. We propose tw...
Sanjay Bapna, Abirami Radhakrishnan, Aryya Gangopa...
FCT
2007
Springer
14 years 1 months ago
On the Topological Complexity of Weakly Recognizable Tree Languages
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
Jacques Duparc, Filip Murlak
CC
2003
Springer
114views System Software» more  CC 2003»
14 years 27 days ago
Combined Code Motion and Register Allocation Using the Value State Dependence Graph
We define the Value State Dependence Graph (VSDG). The VSDG is a form of the Value Dependence Graph (VDG) extended by the addition of state dependence edges to model sequentialise...
Neil Johnson, Alan Mycroft
HPCA
2004
IEEE
14 years 8 months ago
Stream Register Files with Indexed Access
Many current programmable architectures designed to exploit data parallelism require computation to be structured to operate on sequentially accessed vectors or streams of data. A...
Nuwan Jayasena, Mattan Erez, Jung Ho Ahn, William ...
ICPADS
1998
IEEE
13 years 12 months ago
Fast Mutual Exclusion Algorithms Using Read-Modify-Write and Atomic Read/Write Registers
: Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last alg...
Ting-Lu Huang