356 search results - page 61 / 72 » Approximation schemes for the Min-Max Starting Time Problem |
ACCV
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper proposes a fast method for dense 3-D interpretation to directly estimate a dense map of relative depth and motion from a monocular sequence of images on large ...
AIRS
2004
Springer
14 years 28 days ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
WINET
2002
13 years 7 months ago
2002
Abstract. TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless netwo...
MSWIM
2005
ACM
14 years 1 months ago
2005
ACM
Emerging multi-hop wireless mesh networks have much different characteristics than the Internet. They have low dimensionality and large diameters. Content and service replication ...
FOCS
2002
IEEE
14 years 15 days ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...