Sciweavers

8 search results - page 1 / 2
» Construction of Maximum Run-Length Limited Codes Using Seque...
Sort
View
JSAC
2010
107views more  JSAC 2010»
13 years 3 months ago
Construction of Maximum Run-Length Limited Codes Using Sequence Replacement Techniques
Adriaan J. de Lind van Wijngaarden, Kees A. Schouh...
GLVLSI
2009
IEEE
186views VLSI» more  GLVLSI 2009»
13 years 11 months ago
Bitmask-based control word compression for NISC architectures
Implementing a custom hardware is not always feasible due to cost and time considerations. No instruction set computer (NISC) architecture is one of the promising direction to des...
Chetan Murthy, Prabhat Mishra
CCECE
2006
IEEE
13 years 11 months ago
Dynamic and Parallel Approaches to Optimal Evolutionary Tree Construction
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
Anupam Bhattacharjee, Kazi Zakia Sultana, Zalia Sh...
VISSOFT
2005
IEEE
13 years 10 months ago
Interactive Exploration of UML Sequence Diagrams
Sequence diagrams are commonly used to represent object interactions in software systems. Reverse-engineered sequence diagrams, which are constructed from existing code, are becom...
Richard Sharp, Atanas Rountev
DCC
2004
IEEE
14 years 4 months ago
Coding for Fast Access to Image Regions Defined by Pixel Range
Many technical imaging applications, like coding "images" of digital elevation maps, require extracting regions of compressed images in which the pixel values are within...
Amir Said, Sehoon Yea, William A. Pearlman