Sciweavers

1085 search results - page 186 / 217
» On the performance of one-to-many data transformations
Sort
View
ICS
1994
Tsinghua U.
13 years 11 months ago
Compiler and runtime support for out-of-core HPF programs
This paper describes the design of a compiler which can translate out-of-core programs written in a data parallel language like HPF. Such a compiler is required for compiling larg...
Rajeev Thakur, Rajesh Bordawekar, Alok N. Choudhar...
BMVC
2002
13 years 10 months ago
Low Density Feature Point Matching for Articulated Pose Identification
We describe a general algorithm for identifying an arbitrary pose of an articulated subject with low density feature points. The algorithm aims to establish a one-to-one correspon...
Horst Holstein, Baihua Li
ECCV
2002
Springer
14 years 9 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
ICDE
2009
IEEE
182views Database» more  ICDE 2009»
14 years 9 months ago
Adaptive Parallelization of Queries over Dependent Web Service Calls
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...
Manivasakan Sabesan, Tore Risch
SIGSOFT
2007
ACM
14 years 8 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek