7380 search results - page 390 / 1476 » time 2008 |
157
click to vote
WALCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
155
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independ...
146
click to vote
VMV
2003
15 years 8 months ago
2003
We present a new integrated tool, DERMA, which allows to measure and assess the time evolution of chronic wounds. A laser triangulation 3D scanner is used to acquire the wound geo...
182
click to vote
ENDM
2008
15 years 6 months ago
2008
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...
137
click to vote
CSDA
2006
15 years 6 months ago
2006
It is difficult to find an existing single model which is able to simultaneously model exceedances over thresholds in multivariate financial time series. A new modeling approach, ...