Sciweavers

2745 search results - page 60 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
118
Voted
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
16 years 3 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...
BMCBI
2011
14 years 10 months ago
AnyExpress: Integrated toolkit for analysis of cross-platform gene expression data using a fast interval matching algorithm
Background: Cross-platform analysis of gene express data requires multiple, intricate processes at different layers with various platforms. However, existing tools handle only a s...
Jihoon Kim, Kiltesh Patel, Hyunchul Jung, Winston ...
ISBI
2009
IEEE
15 years 10 months ago
Fast Algorithms for Nonconvex Compressive Sensing: MRI Reconstruction from Very Few Data
Compressive sensing is the reconstruction of sparse images or signals from very few samples, by means of solving a tractable optimization problem. In the context of MRI, this can ...
Rick Chartrand
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
15 years 7 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...
152
Voted
WACV
2005
IEEE
15 years 9 months ago
Shared Features for Scalable Appearance-Based Object Recognition
We present a framework for learning object representations for fast recognition of a large number of different objects. Rather than learning and storing feature representations s...
Erik Murphy-Chutorian, Jochen Triesch