Sciweavers

1054 search results - page 71 / 211
» Fast Approximated SIFT
Sort
View
ICIP
2001
IEEE
15 years 11 months ago
Improving a genetic algorithm segmentation by means of a fast edge detection technique
Thispaper presents a new hybrid range image segmentation approach. Two separate techniques are applied consecutively. First, iin edge based segmentation technique extracts the edg...
Angel Domingo Sappa, Vitoantonio Bevilacqua, Miche...
ICML
2005
IEEE
15 years 10 months ago
Fast maximum margin matrix factorization for collaborative prediction
Maximum Margin Matrix Factorization (MMMF) was recently suggested (Srebro et al., 2005) as a convex, infinite dimensional alternative to low-rank approximations and standard facto...
Jason D. M. Rennie, Nathan Srebro
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
15 years 10 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
15 years 10 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,...
ICDAR
2009
IEEE
15 years 4 months ago
Fast Incremental Learning Strategy Driven by Confusion Reject for Online Handwriting Recognition
In this paper, we present a new incremental learning strategy for handwritten character recognition systems. This learning strategy enables the recognition system to learn “rapi...
Abdullah Almaksour, Éric Anquetil