Sciweavers

1765 search results - page 231 / 353
» Combinations of Weak Classifiers
Sort
View
NIPS
2001
15 years 5 months ago
Partially labeled classification with Markov random walks
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
Martin Szummer, Tommi Jaakkola
WEBNET
2001
15 years 5 months ago
Making Sense of Search Results by Automatic Web-page Classifications
: This paper reports the development of a system for automatically organizing Internet web pages into meaningful categories. The aim of the system is to allow Internet users to fin...
Ben Choi
ACL
1998
15 years 5 months ago
Time Mapping with Hypergraphs
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
Jan W. Amtrup, Volker Weber
VCIP
2003
183views Communications» more  VCIP 2003»
15 years 5 months ago
Fast motion estimation and mode decision with variable motion block sizes
The adaptive coding schemes in H.264 standard provide a significant coding efficiency and some additional features like error resilience and network friendliness. The variable blo...
Woong Il Choi, Jeyun Lee, Sungmo Yang, Byeungwoo J...
GRC
2008
IEEE
15 years 5 months ago
Fuzzy Entropy based Max-Relevancy and Min-Redundancy Feature Selection
Feature selection is an important problem for pattern classification systems. Mutual information is a good indicator of relevance between variables, and has been used as a measure...
Shuang An, Qinghua Hu, Daren Yu