Sciweavers

103 search results - page 4 / 21
» High-Probability Syntactic Links
Sort
View
WAIM
2007
Springer
15 years 3 months ago
Improvements of HITS Algorithms for Spam Links
The HITS algorithm proposed by Kleinberg is one of the representative methods of scoring Web pages by using hyperlinks. In the days when the algorithm was proposed, most of the pag...
Yasuhito Asano, Yu Tezuka, Takao Nishizeki
ANLP
1997
111views more  ANLP 1997»
14 years 10 months ago
A non-projective dependency parser
We describe a practical parser for unrestricted dependencies. The parser creates links between words and names the links according to their syntactic functions. We first describe ...
Pasi Tapanainen, Timo Järvinen
TREC
2000
14 years 10 months ago
Syntactic Clues and Lexical Resources in Question-Answering
CL Research's question-answering system (DIMAP-QA) for TREC-9 significantly extends its semantic relation triple (logical form) technology in which documents are fully parsed...
Kenneth C. Litkowski
CORR
2010
Springer
148views Education» more  CORR 2010»
14 years 8 months ago
List decoding for nested lattices and applications to relay channels
— We demonstrate a decoding scheme for nested lattice codes which is able to decode a list of a particular size which contains the transmitted codeword with high probability. Thi...
Yiwei Song, Natasha Devroye
ICALP
2009
Springer
15 years 9 months ago
Rumor Spreading in Social Networks
Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc...
Flavio Chierichetti, Silvio Lattanzi, Alessandro P...