Sciweavers

1445 search results - page 44 / 289
» Uniformly Hard Languages
Sort
View
WCET
2007
13 years 11 months ago
WCET Analysis: The Annotation Language Challenge
Worst-case execution time (WCET) analysis is indispensable for the successful design and development of systems, which, in addition to their functional constraints, have to satisf...
Raimund Kirner, Jens Knoop, Adrian Prantl, Markus ...
CLIN
2003
13 years 11 months ago
Natural Language Processing in Information Retrieval
Many Natural Language Processing (NLP) techniques have been used in Information Retrieval. The results are not encouraging. Simple methods (stopwording, porter-style stemming, etc...
Thorsten Brants
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 10 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
FOCS
2006
IEEE
14 years 4 months ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...
ICWSM
2008
13 years 11 months ago
ASL-STEM Forum: A Bottom-Up Approach to Enabling American Sign Language to Grow in STEM Fields
Deaf and hard of hearing students studying advanced topics in Science, Technology, Engineering, and Mathematics (STEM) lack standard terminology to enable them to learn, discuss a...
Jeffrey P. Bigham, Daniel S. Otero, Jessica N. DeW...