4903 search results - page 309 / 981 » The Set Covering Machine |
188
click to vote
COLT
2003
Springer
16 years 12 hour ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
180
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
126
click to vote
LREC
2010
15 years 8 months ago
2010
In this paper we want to point out some issues arising when a natural language processing task involves several languages (like multilingual, multidocument summarization and the m...
199
click to vote
DAGSTUHL
1998
15 years 8 months ago
1998
Abstract. During the last years, a number of formal specification languages for knowledge-based systems have been developed. Characteristic for knowledge-based systems are a comple...
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...