Sciweavers

10608 search results - page 1844 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ICA
2007
Springer
15 years 2 months ago
Bayesian Estimation of Overcomplete Independent Feature Subspaces for Natural Images
In this paper, we propose a Bayesian estimation approach to extend independent subspace analysis (ISA) for an overcomplete representation without imposing the orthogonal constraint...
Libo Ma, Liqing Zhang
114
Voted
ISLPED
2007
ACM
94views Hardware» more  ISLPED 2007»
15 years 2 months ago
Design of an efficient power delivery network in an soc to enable dynamic power management
Dynamic voltage scaling (DVS) is known to be one of the most efficient techniques for power reduction of integrated circuits. Efficient low voltage DC-DC conversion is a key enabl...
Behnam Amelifard, Massoud Pedram
104
Voted
FSE
2008
Springer
162views Cryptology» more  FSE 2008»
15 years 2 months ago
Collisions on SHA-0 in One Hour
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
Stéphane Manuel, Thomas Peyrin
AAAI
2010
15 years 1 months ago
Evolving Compiler Heuristics to Manage Communication and Contention
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
Matthew E. Taylor, Katherine E. Coons, Behnam Roba...
106
Voted
AAAI
2010
15 years 1 months ago
Decision-Theoretic Control of Crowd-Sourced Workflows
Crowd-sourcing is a recent framework in which human intelligence tasks are outsourced to a crowd of unknown people ("workers") as an open call (e.g., on Amazon's Me...
Peng Dai, Mausam, Daniel S. Weld
« Prev « First page 1844 / 2122 Last » Next »