Sciweavers

2988 search results - page 304 / 598
» Experiments with a New Boosting Algorithm
Sort
View
115
Voted
COLING
2010
14 years 10 months ago
Knowing What to Believe (when you already know something)
Although much work in NLP has focused on simply determining what a document means, we also must know whether or not to believe it. Fact-finding algorithms attempt to identify the ...
Jeff Pasternack, Dan Roth
167
Voted
TKDE
2011
479views more  TKDE 2011»
14 years 10 months ago
Learning Semi-Riemannian Metrics for Semisupervised Feature Extraction
—Discriminant feature extraction plays a central role in pattern recognition and classification. Linear Discriminant Analysis (LDA) is a traditional algorithm for supervised feat...
Wei Zhang, Zhouchen Lin, Xiaoou Tang
235
Voted

Publication
163views
13 years 11 months ago
Saliency Maps of High Dynamic Range Images
A number of computational models of visual attention have been proposed based on the concept of saliency map. Some of them have been validated as predictors of the visual scan-path...
Roland Brémond, Josselin Petit and Jean-Philippe...
141
Voted
CVPR
2005
IEEE
16 years 5 months ago
Graph Embedding: A General Framework for Dimensionality Reduction
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
197
Voted
VLDB
1999
ACM
224views Database» more  VLDB 1999»
15 years 8 months ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim