Sciweavers

762 search results - page 23 / 153
» Finding Facilities Fast
Sort
View
ICCV
2003
IEEE
15 years 11 months ago
Fast Pose Estimation with Parameter-Sensitive Hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
15 years 10 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
83
Voted
EDBT
2006
ACM
172views Database» more  EDBT 2006»
15 years 9 months ago
Fast Query Point Movement Techniques with Relevance Feedback for Content-Based Image Retrieval
Abstract. Target search in content-based image retrieval (CBIR) systems refers to finding a specific (target) image such as a particular registered logo or a specific historical ph...
Danzhou Liu, Kien A. Hua, Khanh Vu, Ning Yu
MICCAI
2009
Springer
15 years 7 months ago
Fast Automatic Segmentation of the Esophagus from 3D CT Data Using a Probabilistic Model
Automated segmentation of the esophagus in CT images is of high value to radiologists for oncological examinations of the mediastinum. It can serve as a guideline and prevent confu...
Johannes Feulner, Shaohua Kevin Zhou, Alexander Ca...
ITCC
2005
IEEE
15 years 3 months ago
Fast Parallel Table Lookups to Accelerate Symmetric-Key Cryptography
1 Table lookups are one of the most frequently-used operations in symmetric-key ciphers. Particularly in the newer algorithms such as the Advanced Encryption Standard (AES), we fr...
A. Murat Fiskiran, Ruby B. Lee