Sciweavers

3415 search results - page 546 / 683
» Lower Bounds for Kernelizations
Sort
View
MFCS
2004
Springer
15 years 9 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
SCOPES
2004
Springer
15 years 9 months ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 9 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
DCC
2003
IEEE
15 years 9 months ago
Universal Multiple Description Scalar Quantization: Analysis and Design
—This paper introduces a new high-rate analysis of the multiple description scalar quantizer (MDSQ) with balanced descriptions. The analysis provides insight into the structure o...
Chao Tian, Sheila S. Hemami
ISCC
2003
IEEE
15 years 9 months ago
Throughput Achievable with No Relaying in a Mobile Interference Network
— We consider a network of n sender/receiver pairs, placed randomly in a region of unit area. Network capacity, or maximum throughput, is defined as the highest rate that can be...
Elif Uysal-Biyikoglu, Abtin Keshavarzian