4908 search results - page 404 / 982 » On the Complexity of Optimal K-Anonymity |
200
click to vote
Publication
_2011.jpg "NeuFlow: A Runtime Reconfigurable Dataflow Processor for Vision")
In this paper we present a scalable dataflow hard- ware architecture optimized for the computation of general- purpose vision algorithms—neuFlow—and a dataflow compiler—luaFl...
174
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The richness of natural images makes the quest for optimal representations in image processing and computer vision challenging. The latter observation has not prevented the design...
192
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
182
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
271
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...