Sciweavers

4843 search results - page 248 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
178
Voted
COCOON
2010
Springer
15 years 2 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen
FQAS
2009
Springer
127views Database» more  FQAS 2009»
15 years 10 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
127
Voted
VTC
2008
IEEE
161views Communications» more  VTC 2008»
15 years 10 months ago
Evaluation of Outage Restricted Distributed MIMO Multi-Hop Networks by the Improved Approximative Power Allocation
—The concept of Virtual Antenna Array (VAA) is a promising approach to apply MIMO concepts in relaying systems. In order to fulfill a given Quality-of-Service (QoS) requirement ...
Dirk Wubben
146
Voted
ICASSP
2007
IEEE
15 years 10 months ago
Quantized Sparse Approximation with Iterative Thresholding for Audio Coding
Sparse coding is a new field in signal processing with possible applications to source coding. In this paper we present a new method that combines the problems of sparse signal a...
Mehrdad Yaghoobi, Thomas Blumensath, Mike E. Davie...
170
Voted
PG
2007
IEEE
15 years 10 months ago
Developable Strip Approximation of Parametric Surfaces with Global Error Bounds
Developable surfaces have many desired properties in manufacturing process. Since most existing CAD systems utilize parametric surfaces as the design primitive, there is a great d...
Yong-Jin Liu, Yu-Kun Lai, Shi-Min Hu