251 search results - page 28 / 51 » Constructive Linear Time Algorithms for Branchwidth |
126
click to vote
EDBT
2009
ACM
15 years 5 months ago
2009
ACM
Constructing Haar wavelet synopses under a given approximation error has many real world applications. In this paper, we take a novel approach towards constructing unrestricted Ha...
123
click to vote
ICDCS
1998
IEEE
15 years 6 months ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
132
click to vote
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
128
Voted
ICCV
2001
IEEE
16 years 4 months ago
2001
IEEE
Window size and shape selection is a difficult problem in area based stereo. We propose an algorithm which chooses an appropriate window shape by optimizing over a large class of ...
107
click to vote
ISCC
2006
IEEE
15 years 8 months ago
2006
IEEE
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...