Sciweavers

3898 search results - page 167 / 780
» On the Bit Extraction Problem
Sort
View
IJCAI
1989
15 years 4 months ago
A Technique for Customizing Object-Oriented Knowledge Representation Systems, With An Application to Network Problem Management
Over the last few years, object-oriented techniques have gained an increasing recognition both in software engineering and in AI. Object-oriented systems present undisputable adva...
Lisiane Goffaux, Robert Mathonet
NIPS
1992
15 years 4 months ago
Some Solutions to the Missing Feature Problem in Vision
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
Subutai Ahmad, Volker Tresp
WWW
2009
ACM
16 years 3 months ago
Incorporating site-level knowledge to extract structured data from web forums
Web forums have become an important data resource for many web applications, but extracting structured data from unstructured web forum pages is still a challenging task due to bo...
Jiang-Ming Yang, Rui Cai, Yida Wang, Jun Zhu, Lei ...
EMNLP
2009
15 years 18 days ago
Toward Completeness in Concept Extraction and Classification
Many algorithms extract terms from text together with some kind of taxonomic classification (is-a) link. However, the general approaches used today, and specifically the methods o...
Eduard H. Hovy, Zornitsa Kozareva, Ellen Riloff
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 3 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman