7129 search results - page 865 / 1426 » Approximation Algorithms for Treewidth |
144
click to vote
FAW
2008
Springer
15 years 8 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
151
click to vote
CLA
2007
15 years 7 months ago
2007
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
130
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
161
click to vote
EMNLP
2008
15 years 7 months ago
2008
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
172
click to vote
ESANN
2008
15 years 7 months ago
2008
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...