2184 search results - page 157 / 437 » Relative Entropy and Statistics |
119
Voted
KDD
2008
ACM
16 years 1 months ago
2008
ACM
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
110
click to vote
ICDE
2010
IEEE
16 years 23 days ago
2010
IEEE
Abstract-Unstructured text represents a large fraction of the world's data. It often contain snippets of structured information within them (e.g., people's names and zip ...
GFKL
2006
Springer
15 years 4 months ago
2006
Springer
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
CICLING
2009
Springer
16 years 1 months ago
2009
Springer
Where the field has been and where it is going? It is relatively easy to know where we have been, but harder (and more valuable) to know where we are going. The title of this paper...
109
Voted
CORR
2007
Springer
15 years 1 months ago
2007
Springer
The high volume of packets and packet rates of traffic on some router links makes it exceedingly difficult for routers to examine every packet in order to keep detailed statistics ...