3466 search results - page 525 / 694 » Fast computation of special resultants |
188
click to vote
ENTCS
2008
15 years 6 months ago
2008
Reactive programs have to react continuously to their inputs. Here the time needed to react with the according output is important. While the synchrony hypothesis takes the view t...
171
click to vote
EOR
2006
15 years 6 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
143
click to vote
CCR
2007
15 years 6 months ago
2007
Delayed acknowledgments were introduced to conserve network and host resources. Further reduction of the acknowledgment frequency can be motivated in the same way. However, reduci...
164
click to vote
IPM
2008
15 years 6 months ago
2008
A fast and efficient page ranking mechanism for web crawling and retrieval remains as a challenging issue. Recently, several link based ranking algorithms like PageRank, HITS and ...
201
click to vote
IJCV
2006
15 years 6 months ago
2006
We present a novel framework for motion segmentation that combines the concepts of layer-based methods and feature-based motion estimation. We estimate the initial correspondences...