5 search results - page 1 / 1 » Estimating Translation Probabilities from the Web for Struct... |
ECIR
2010
Springer
13 years 6 months ago
2010
Springer
We present two methods for estimating replacement probabilities without using parallel corpora. The first method proposed exploits the possible translation probabilities latent in ...
CLEF
2008
Springer
13 years 6 months ago
2008
Springer
In this study we will discuss our cross language text retrieval (CLIR) experiments of Persian ad hoc track at CLEF 2008. Two teams from University of Tehran were involved in cross...
EMNLP
2011
12 years 4 months ago
2011
We propose a general method to watermark and probabilistically identify the structured outputs of machine learning algorithms. Our method is robust to local editing operations and...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
WWW
2005
ACM
14 years 5 months ago
2005
ACM
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...