Sciweavers

194 search results - page 25 / 39
» MAP: Searching Large Genome Databases
Sort
View
PAMI
2011
13 years 3 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
CVPR
2008
IEEE
14 years 10 months ago
Manifold learning using robust Graph Laplacian for interactive image search
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in partially labeling a ...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
CORR
2006
Springer
178views Education» more  CORR 2006»
13 years 8 months ago
A tool set for the quick and efficient exploration of large document collections
: We are presenting a set of multilingual text analysis tools that can help analysts in any field to explore large document collections quickly in order to determine whether the do...
Camelia Ignat, Bruno Pouliquen, Ralf Steinberger, ...
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
13 years 16 days ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi
ICIP
2004
IEEE
14 years 10 months ago
Feature statistical retrieval applied to content-based copy identification
In many image or video retrieval systems, the search of similar objects in the database includes a spatial access method to a multidimensional feature space. This step is generall...
Alexis Joly, Carl Frélicot, Olivier Buisson