Sciweavers

8706 search results - page 289 / 1742
» Learning Subjective Language
Sort
View
DGO
2008
170views Education» more  DGO 2008»
15 years 4 months ago
Natural language processing and e-Government: crime information extraction from heterogeneous data sources
Much information that could help solve and prevent crimes is never gathered because the reporting methods available to citizens and law enforcement personnel are not optimal. Dete...
Chih Hao Ku, Alicia Iriberri, Gondy Leroy
194
Voted
SOFTVIS
2010
ACM
15 years 2 months ago
AllocRay: memory allocation visualization for unmanaged languages
A programs memory system performance is one of the key determinants of its overall performance. Lack of understanding of a programs memory system behavior can lead to performance ...
George G. Robertson, Trishul M. Chilimbi, Bongshin...
115
Voted
WWW
2005
ACM
16 years 3 months ago
A search engine for natural language applications
Many modern natural language-processing applications utilize search engines to locate large numbers of Web documents or to compute statistics over the Web corpus. Yet Web search e...
Michael J. Cafarella, Oren Etzioni
MSR
2006
ACM
15 years 8 months ago
TA-RE: an exchange language for mining software repositories
Software repositories have been getting a lot of attention from researchers in recent years. In order to analyze software repositories, it is necessary to first extract raw data f...
Sunghun Kim, Thomas Zimmermann, Miryung Kim, Ahmed...
134
Voted
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
15 years 8 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma