Sciweavers

2479 search results - page 400 / 496
» Random Event Structures
Sort
View
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
14 years 2 months ago
Practical Loss-Resilient Codes
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...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
14 years 1 days ago
Search decisions for teams of automata
Abstract-- The dynamics of exploration vs exploitation decisions are explored in the context of robotic search problems. Building on prior work on robotic search together with our ...
Dimitar Baronov, John Baillieul
CIKM
2008
Springer
14 years 1 days ago
Identifying table boundaries in digital documents via sparse line detection
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...
Ying Liu, Prasenjit Mitra, C. Lee Giles
ALENEX
2010
156views Algorithms» more  ALENEX 2010»
13 years 11 months ago
Tabulation Based 5-Universal Hashing and Linear Probing
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...
Mikkel Thorup, Yin Zhang
ANLP
2000
141views more  ANLP 2000»
13 years 11 months ago
Aggressive Morphology for Robust Lexical Coverage
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...
William A. Woods