Sciweavers

5606 search results - page 888 / 1122
» Randomization Techniques for Graphs.
Sort
View
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 10 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
CCS
2006
ACM
15 years 10 months ago
Packet vaccine: black-box exploit detection and signature generation
In biology, a vaccine is a weakened strain of a virus or bacterium that is intentionally injected into the body for the purpose of stimulating antibody production. Inspired by thi...
XiaoFeng Wang, Zhuowei Li, Jun Xu, Michael K. Reit...
SIGSOFT
1995
ACM
15 years 10 months ago
An Experiment to Assess the Cost-Benefits of Code Inspections in Large Scale Software Development
—We conducted a long-term experiment to compare the costs and benefits of several different software inspection methods. These methods were applied by professional developers to ...
Adam A. Porter, Harvey P. Siy, Carol A. Toman, Law...
CIKM
2008
Springer
15 years 8 months 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
ANLP
2000
141views more  ANLP 2000»
15 years 8 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