6740 search results - page 1011 / 1348 » An s -Hamiltonian Line Graph Problem |
188
Voted
AINA
2003
IEEE
16 years 3 days ago
2003
IEEE
This paper endeavors to present a scheme to detect and estimate bottleneck bandwidth along the path in the Internet. We have participated in the RIPE NCC’s TTM project to perfor...
181
click to vote
ICAT
2003
IEEE
16 years 3 days ago
2003
IEEE
Any VR scenario should offer a certain degree of nonlinearity or openness regarding the story progress as a consequence of the interaction with the user. In this paper we propose ...
204
click to vote
IPPS
2003
IEEE
16 years 2 days ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
181
Voted
ADBIS
2003
Springer
16 years 1 days ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
182
click to vote
AGTIVE
2003
Springer
16 years 1 days ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...