Sciweavers

589 search results - page 57 / 118
» Location-dependent query processing: Where we are and where ...
Sort
View
ESA
2004
Springer
137views Algorithms» more  ESA 2004»
14 years 1 months ago
Fast 3-Coloring Triangle-Free Planar Graphs
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
Lukasz Kowalik
EMNLP
2008
13 years 9 months ago
An Analysis of Active Learning Strategies for Sequence Labeling Tasks
Active learning is well-suited to many problems in natural language processing, where unlabeled data may be abundant but annotation is slow and expensive. This paper aims to shed ...
Burr Settles, Mark Craven
CN
2000
92views more  CN 2000»
13 years 7 months ago
What is this page known for? Computing Web page reputations
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
Davood Rafiei, Alberto O. Mendelzon
ICASSP
2010
IEEE
13 years 7 months ago
Balancing false alarms and hits in Spoken Term Detection
This paper presents methods to improve retrieval of Out-OfVocabulary (OOV) terms in a Spoken Term Detection (STD) system. We demonstrate that automated tagging of OOV regions help...
Carolina Parada, Abhinav Sethy, Bhuvana Ramabhadra...
WWW
2010
ACM
14 years 1 months ago
Data summaries for on-demand queries over linked data
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
Andreas Harth, Katja Hose, Marcel Karnstedt, Axel ...