Sciweavers

277 search results - page 1 / 56
» Determining detailed structural correspondence for generaliz...
Sort
View
SIGSOFT
2007
ACM
14 years 5 months ago
Determining detailed structural correspondence for generalization tasks
Generalization tasks are important for continual improvement to the design of an evolving code base, eliminating redundancy where it has accumulated. An important step in generali...
Jörg Denzinger, Joseph J. C. Chang, Robert J....
TCS
2002
13 years 4 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
SIGSOFT
2008
ACM
14 years 5 months ago
Semi-automating small-scale source code reuse via structural correspondence
Developers perform small-scale reuse tasks to save time and to increase the quality of their code, but due to their small scale, the costs of such tasks can quickly outweigh their...
Rylan Cottrell, Robert J. Walker, Jörg Denzin...
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
13 years 10 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka
AAAI
2000
13 years 6 months ago
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
Tuomas Sandholm, Subhash Suri