6251 search results - page 444 / 1251 » Randomness, Computability, and Density |
175
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph co...
198
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
We propose a methodology for applying gate-level logic transformations to optimize power in digital circuits. Statistically simulated[14] switching information, gate delays, signa...
178
click to vote
DCC
2005
IEEE
15 years 8 months ago
2005
IEEE
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields....
169
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
200
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
The compressed-sensing recovery of video sequences driven by multihypothesis predictions is considered. Specifically, multihypothesis predictions of the current frame are used to...