Sciweavers

1670 search results - page 86 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
EUROCAST
2003
Springer
108views Hardware» more  EUROCAST 2003»
15 years 8 months ago
Fast Entropy-Based Nonrigid Registration
Computer vision tasks such as learning, recognition, classification or segmentation applied to spatial data often requires spatial normalization of repeated features and structure...
Eduardo Suárez, Jose Aurelio Santana, Eduar...
CAMP
2005
IEEE
15 years 8 months ago
Speeding-up NCC-Based Template Matching Using Parallel Multimedia Instructions
— This paper describes the mapping of a recently introduced template matching algorithm based on the Normalized Cross Correlation (NCC) on a general purpose processor endowed wit...
Luigi di Stefano, Stefano Mattoccia, Federico Tomb...
SDMW
2004
Springer
15 years 8 months ago
Secure and Privacy Preserving Outsourcing of Tree Structured Data
With the increasing use of web services, many new challenges concerning data security are becoming critical. Data or applications can now be outsourced to powerful remote servers, ...
Ping Lin, K. Selçuk Candan
APBC
2007
110views Bioinformatics» more  APBC 2007»
15 years 4 months ago
Fast Structural Similarity Search Based on Topology String Matching
ibe an abstract data model of protein structures by representing the geometry of proteins using spatial data types and present a framework for fast structural similarity search bas...
Sung-Hee Park, David Gilbert, Keun Ho Ryu
CVPR
2004
IEEE
16 years 5 months ago
Robust Subspace Clustering by Combined Use of kNND Metric and SVD Algorithm
Subspace clustering has many applications in computer vision, such as image/video segmentation and pattern classification. The major issue in subspace clustering is to obtain the ...
Qifa Ke, Takeo Kanade