1650 search results - page 191 / 330 » The HOM problem is decidable |
196
Voted
ESA
2011
Springer
14 years 4 months ago
2011
Springer
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
255
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
142
Voted
IPSN
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
122
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
129
click to vote
ADHOC
2010
15 years 4 months ago
2010
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...