329 search results - page 63 / 66 » An algorithm for recognition of n-collapsing words |
112
click to vote
IJSI
2008
14 years 12 months ago
2008
Many data mining applications have a large amount of data but labeling data is often difficult, expensive, or time consuming, as it requires human experts for annotation. Semi-supe...
109
click to vote
JCT
2008
14 years 12 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
113
click to vote
COMCOM
1998
14 years 11 months ago
1998
As computers and Internet become more and more available to families, access of objectionable graphics by children is increasingly a problem that many parents are concerned about....
113
click to vote
TASLP
2010
14 years 6 months ago
2010
This paper presents a novel probabilistic approach to speech enhancement. Instead of a deterministic logarithmic relationship, we assume a probabilistic relationship between the fr...
WWW
2008
ACM
16 years 18 days ago
2008
ACM
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...