3708 search results - page 481 / 742 » Approximating Betweenness Centrality |
181
click to vote
NIPS
2007
15 years 8 months ago
2007
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
160
click to vote
ACL
2006
15 years 8 months ago
2006
We investigate the connection between part of speech (POS) distribution and content in language. We define POS blocks to be groups of parts of speech. We hypothesise that there ex...
184
click to vote
SIROCCO
2001
15 years 8 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
149
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
169
click to vote
SSWMC
2004
15 years 8 months ago
2004
We study a detection-theoretic approach to steganalysis. The relative entropy between covertext and stegotext determines the steganalyzer's difficulty in discriminating them,...