897 search results - page 27 / 180 » Identity: How to name it, How to find it |
KDD
2007
ACM
14 years 9 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
FMCAD
2004
Springer
14 years 11 days ago
2004
Springer
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
EMNLP
2008
13 years 10 months ago
2008
This paper describes a language-independent, scalable system for both challenges of crossdocument co-reference: name variation and entity disambiguation. We provide system results...
MANSCI
2008
13 years 8 months ago
2008
We study large-scale service systems with multiple customer classes and many statistically identical servers. The following question is addressed: How many servers are required (s...
BIRD
2008
Springer
13 years 10 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...