Sciweavers

562 search results - page 63 / 113
» Approximation algorithms and hardness of the k-route cut pro...
Sort
View
DAM
2007
60views more  DAM 2007»
13 years 8 months ago
Restricting SBH ambiguity via restriction enzymes
The expected number of n-base long sequences consistent with a given SBH spectrum grows exponentially with n, which severely limits the potential range of applicability of SBH even...
Steven Skiena, Sagi Snir
SGP
2007
13 years 10 months ago
Shape reconstruction from unorganized cross-sections
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...
Jean-Daniel Boissonnat, Pooran Memari
COCOON
2011
Springer
12 years 7 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
TSP
2012
12 years 3 months ago
Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...
PVLDB
2010
134views more  PVLDB 2010»
13 years 6 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...