1431 search results - page 195 / 287 » The complexity of random ordered structures |
116
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Many Peer-to-peer (P2P) applications such as media broadcasting and content distribution require a high performance overlay structure in order to deliver satisfying quality of ...
198
Voted
STOC
1997
ACM
15 years 7 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
171
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
137
Voted
ALENEX
2010
15 years 5 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
133
Voted
ANLP
2000
15 years 4 months ago
2000
This paper describes an approach to providing lexical information for natural language processing in unrestricted domains. A system of approximately 1200 morphological rules is us...