2585 search results - page 192 / 517 » computing 1999 |
133
click to vote
EMMCVPR
1999
Springer
15 years 8 months ago
1999
Springer
In this paper, we propose two Bayesian methods for detecting and grouping junctions. Our junction detection method evolves from the Kona approach, and it is based on a competitive ...
136
click to vote
HIPC
1999
Springer
15 years 8 months ago
1999
Springer
An analytical framework for modeling the performance of a single TCP session in the presence of random packet loss is presented that is based on a semi-Markov model for the window ...
144
click to vote
HUC
1999
Springer
15 years 8 months ago
1999
Springer
Interaction problems occur when small-screen devices (PDAs, Palmtops etc) are used to access Web pages designed for conventional, largescreen displays. To overcome some of these pr...
119
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Checkpointing is a very effective technique to tolerate the occurrence of failures in distributed and parallel applications. The existing algorithms in the literature are basicall...
157
click to vote
WG
1995
Springer
15 years 7 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...