Sciweavers

5675 search results - page 919 / 1135
» Exploiting Chaos for Computation
Sort
View
PAMI
2007
202views more  PAMI 2007»
15 years 6 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
PR
2007
127views more  PR 2007»
15 years 6 months ago
Face recognition using spectral features
Face recognition is a challenging task in computer vision and pattern recognition. It is well-known that obtaining a low-dimensional feature representation with enhanced discrimin...
Fei Wang, Jingdong Wang, Changshui Zhang, James T....
PRL
2008
122views more  PRL 2008»
15 years 6 months ago
Constraints for closest point finding
The traditional closest point criterion has been widely used for 3D free form shape matching, object recognition, internet search, computer graphics and medical imaging. However, ...
Yonghuai Liu
PVLDB
2008
201views more  PVLDB 2008»
15 years 6 months ago
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data inte...
Chuan Xiao, Wei Wang 0011, Xuemin Lin
CCS
2010
ACM
15 years 6 months ago
NoTamper: automatic blackbox detection of parameter tampering opportunities in web applications
Web applications rely heavily on client-side computation to examine and validate form inputs that are supplied by a user (e.g., “credit card expiration date must be valid”). T...
Prithvi Bisht, Timothy Hinrichs, Nazari Skrupsky, ...