Sciweavers

3047 search results - page 591 / 610
» Randomized Parallel Selection
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 11 months ago
Segmented compressed sampling for analog-to-information conversion: Method and performance analysis
A new segmented compressed sampling (CS) method for analog-to-information conversion (AIC) is proposed. An analog signal measured by a number of parallel branches of mixers and int...
Omid Taheri, Sergiy A. Vorobyov
TVLSI
2010
14 years 8 months ago
C-Pack: A High-Performance Microprocessor Cache Compression Algorithm
Microprocessor designers have been torn between tight constraints on the amount of on-chip cache memory and the high latency of off-chip memory, such as dynamic random access memor...
Xi Chen, Lei Yang, Robert P. Dick, Li Shang, Haris...
DC
2011
14 years 1 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 2 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
BMCBI
2007
104views more  BMCBI 2007»
15 years 1 months ago
Identification of putative regulatory upstream ORFs in the yeast genome using heuristics and evolutionary conservation
Background: The translational efficiency of an mRNA can be modulated by upstream open reading frames (uORFs) present in certain genes. A uORF can attenuate translation of the main...
Marija Cvijovic, Daniel Dalevi, Elizabeth Bilsland...