1998 search results - page 181 / 400 » Complexity of the Cover Polynomial |
141
click to vote
EJC
1998
15 years 6 months ago
1998
in Proceedings of EuroCG, Berlin, M¨arz 2001, pp. 142–145. [14] Branched coverings, triangulations, and 3-manifolds, (mit Ivan Izmestiev). Adv. Geometry, 3:191–225, 2003. [15]...
172
click to vote
ACL
2010
15 years 4 months ago
2010
Building an accurate Named Entity Recognition (NER) system for languages with complex morphology is a challenging task. In this paper, we present research that explores the featur...
295
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
206
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
155
click to vote
DCOSS
2009
Springer
16 years 1 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...