Sciweavers

1579 search results - page 48 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
TII
2010
166views Education» more  TII 2010»
14 years 4 months ago
Source-to-Source Architecture Transformation for Performance Optimization in BIP
Behavior, Interaction, Priorities (BIP) is a component framework for constructing systems from a set of atomic components by using two kinds of composition operators: interactions ...
Marius Bozga, Mohamad Jaber, Joseph Sifakis
PLDI
2011
ACM
14 years 17 days ago
Data representation synthesis
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
IEEEPACT
2003
IEEE
15 years 3 months ago
Y-Branches: When You Come to a Fork in the Road, Take It
In this paper, we study the effects of manipulating the architected direction of conditional branches. Through the use of statistical sampling, we find that about 40% of all dyna...
Nicholas J. Wang, Michael Fertig, Sanjay J. Patel
CSMR
2005
IEEE
15 years 3 months ago
Clustering Data Retrieved from Java Source Code to Support Software Maintenance: A Case Study
Data mining is a technology recently used in support of software maintenance in various contexts. Our works focuses on achieving a high level understanding of Java systems without...
Dimitris Rousidis, Christos Tjortjis
TIT
2008
83views more  TIT 2008»
14 years 9 months ago
Hard Problems of Algebraic Geometry Codes
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
Qi Cheng