Sciweavers

341 search results - page 14 / 69
» Redundancy elimination revisited
Sort
View
TIT
2010
103views Education» more  TIT 2010»
13 years 2 months ago
Knuth's balanced codes revisited
Abstract--In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of "1"s and "01"s, called balanced ...
Jos H. Weber, Kees A. Schouhamer Immink
JUCS
2010
115views more  JUCS 2010»
13 years 2 months ago
Redundant Relations in Relational Databases: A Model Theoretic Perspective
: We initiate in this work the study of a sort of redundancy problem revealed by what we call redundant relations. Roughly, we define a redundant relation in a database instance (d...
Flavio Antonio Ferrarotti, Alejandra Lorena Paolet...
OTM
2009
Springer
14 years 2 months ago
Revisiting the Behavior of Fault and Compensation Handlers in WS-BPEL
When automating work, it is often desirable to compensate completed work by undoing the work done by one or more activities. In the context of workflow, where compensation actions...
Rania Khalaf, Dieter Roller, Frank Leymann
LCPC
2005
Springer
14 years 1 months ago
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt
TSP
2010
13 years 2 months ago
Generalized adaptive notch smoothing revisited
The problem of identification of quasi-periodically varying dynamic systems is considered. This problem can be solved using generalized adaptive notch filtering (GANF) algorithms. ...
Maciej Niedzwiecki