Sciweavers

461 search results - page 76 / 93
» Splitting NP-Complete Sets
Sort
View
FOCS
2007
IEEE
15 years 6 months ago
Parameterized Proof Complexity
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
BMCBI
2005
140views more  BMCBI 2005»
14 years 11 months ago
Dissecting systems-wide data using mixture models: application to identify affected cellular processes
Background: Functional analysis of data from genome-scale experiments, such as microarrays, requires an extensive selection of differentially expressed genes. Under many condition...
J. Peter Svensson, Renée X. de Menezes, Ing...
SIGMOD
2008
ACM
107views Database» more  SIGMOD 2008»
15 years 12 months ago
Outlier-robust clustering using independent components
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Christian Böhm, Christos Faloutsos, Claudia P...
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
15 years 9 months ago
Mining Complex Spatio-Temporal Sequence Patterns.
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
Florian Verhein
LLL
1999
Springer
15 years 4 months ago
Learning to Lemmatise Slovene Words
Abstract. Automatic lemmatisation is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma to each ...
Saso Dzeroski, Tomaz Erjavec