11211 search results - page 1909 / 2243 » Data Structures |
171
click to vote
WMPI
2004
ACM
16 years 3 days ago
2004
ACM
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
171
click to vote
TKDE
2010
15 years 5 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
199
click to vote
INFOCOM
2006
IEEE
16 years 21 days ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
176
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...
215
Voted
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
In this paper, we consider the problem of super-resolving a human face video by a very high (?16) zoom factor. Inspired by recent literature on hallucination and examplebased lear...