6094 search results - page 1013 / 1219 » Applications of a Color-Naming Database |
259
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
282
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
254
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...
354
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
282
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...