3864 search results - page 143 / 773 » time 2005 |
156
click to vote
WG
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
160
click to vote
CCR
2005
15 years 6 months ago
2005
We describe and analyse in details the various factors that influence the convergence time of intradomain link state routing protocols. This convergence time reflects the time req...
169
click to vote
SAINT
2005
IEEE
15 years 12 months ago
2005
IEEE
Basket Analysis is mathematically characterized and extended to search families of sets in this paper. These theories indicate the possibility of various new approaches of data mi...
271
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
114
click to vote
FSTTCS
2005
Springer
15 years 12 months ago
2005
Springer
TPTL and MTL are two classical timed extensions of LTL. In this paper, we positively answer a 15-year-old conjecture that TPTL is strictly more expressive than MTL. But we show tha...