Sciweavers

251 search results - page 22 / 51
» Constructive Linear Time Algorithms for Branchwidth
Sort
View
IPPS
1998
IEEE
15 years 1 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
IPPS
2000
IEEE
15 years 1 months ago
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
Jie Wu
ESA
2005
Springer
107views Algorithms» more  ESA 2005»
15 years 3 months ago
Workload-Optimal Histograms on Streams
Histograms are used in many ways in conventional databases and in data stream processing for summarizing massive data distributions. Previous work on constructing histograms on da...
S. Muthukrishnan, Martin Strauss, X. Zheng
CAGD
2000
62views more  CAGD 2000»
14 years 9 months ago
Volume morphing and rendering - An integrated approach
In this paper, we first introduce a 3D morphing method for landmark-based volume deformation, using various scattered data interpolation schemes. Qualitative and speed comparisons...
Shiaofen Fang, Rajagopalan Srinivasan, Raghu Ragha...
ACCV
2010
Springer
14 years 4 months ago
A Direct Method for Estimating Planar Projective Transform
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
Yu-Tseh Chi, Jeffrey Ho, Ming-Hsuan Yang