Sciweavers

1403 search results - page 145 / 281
» Set cover algorithms for very large datasets
Sort
View
ACL
2011
14 years 9 months ago
Template-Based Information Extraction without the Templates
Standard algorithms for template-based information extraction (IE) require predefined template schemas, and often labeled data, to learn to extract their slot fillers (e.g., an ...
Nathanael Chambers, Dan Jurafsky
KDD
2004
ACM
195views Data Mining» more  KDD 2004»
16 years 6 months ago
Improved robustness of signature-based near-replica detection via lexicon randomization
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
Aleksander Kolcz, Abdur Chowdhury, Joshua Alspecto...
192
Voted
ICCV
2011
IEEE
14 years 6 months ago
Optimal Landmark Detection using Shape Models and Branch and Bound
Fitting statistical 2D and 3D shape models to images is necessary for a variety of tasks, such as video editing and face recognition. Much progress has been made on local fitting...
Brian Amberg, Thomas Vetter
BMCBI
2006
142views more  BMCBI 2006»
15 years 6 months ago
Improving the Performance of SVM-RFE to Select Genes in Microarray Data
Background: Recursive Feature Elimination is a common and well-studied method for reducing the number of attributes used for further analysis or development of prediction models. ...
Yuanyuan Ding, Dawn Wilkins
ICDAR
2011
IEEE
14 years 5 months ago
Chinese Keyword Spotting Using Knowledge-Based Clustering
—Content-based document image retrieval is a new and promising research area. Without OCR, document indexing directly based on image content is more general and convenient. Howev...
Yong Xia, Kuanquan Wang, Mingwei Li