Sciweavers

4 search results - page 1 / 1
» Randomly removing g handles at once
Sort
View
COMPGEOM
2009
ACM
13 years 11 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...
ICMCS
2006
IEEE
107views Multimedia» more  ICMCS 2006»
13 years 11 months ago
Rain Removal in Video by Combining Temporal and Chromatic Properties
Removal of rain streaks in video is a challenging problem due to the random spatial distribution and fast motion of rain. This paper presents a new rain removal algorithm that inc...
Xiaopeng Zhang, Hao Li, Yingyi Qi, Wee Kheng Leow,...
ACMSE
1990
ACM
13 years 9 months ago
Computerizing a machine readable dictionary
Current research in natural language processing is characterized by the development of theories of grammar which strongly depend on the lexicon to drive parsing systems (e.g. Lexi...
Jan G. Wilms
CACM
2008
131views more  CACM 2008»
13 years 5 months ago
Exterminator: Automatically correcting memory errors with high probability
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...
Gene Novark, Emery D. Berger, Benjamin G. Zorn