Sciweavers

7228 search results - page 1262 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
FOCS
2008
IEEE
15 years 4 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
GLVLSI
2007
IEEE
141views VLSI» more  GLVLSI 2007»
15 years 4 months ago
Transition-activity aware design of reduction-stages for parallel multipliers
We propose an interconnect reorganization algorithm for reduction stages in parallel multipliers. It aims at minimizing power consumption for given static probabilities at the pri...
Saeeid Tahmasbi Oskuii, Per Gunnar Kjeldsberg, Osc...
GLVLSI
2007
IEEE
158views VLSI» more  GLVLSI 2007»
15 years 4 months ago
Design of a versatile and cost-effective hybrid floating-point/LNS arithmetic processor
LNS (logarithmic number system) arithmetic has the advantages of high-precision and high performance in complex function computation. However, the large hardware problem in LNS ad...
Chichyang Chen, Paul Chow
KBSE
2007
IEEE
15 years 4 months ago
Assertion-based repair of complex data structures
Programmers have long used assertions to characterize properties of code. An assertion violation signals a corruption in the program state. At such a state, it is standard to term...
Bassem Elkarablieh, Ivan Garcia, Yuk Lai Suen, Sar...
ATAL
2007
Springer
15 years 4 months ago
Effective tag mechanisms for evolving coordination
Tags or observable features shared by a group of similar agents are effectively used in real and artificial societies to signal intentions and can be used to infer unobservable ...
Matthew Matlock, Sandip Sen
« Prev « First page 1262 / 1446 Last » Next »