Sciweavers

7648 search results - page 1086 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
SIGSOFT
2005
ACM
16 years 5 months ago
Matching execution histories of program versions
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
Xiangyu Zhang, Rajiv Gupta
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
15 years 11 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 9 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
ECCV
2002
Springer
16 years 6 months ago
A Probabilistic Multi-scale Model for Contour Completion Based on Image Statistics
We derive a probabilistic multi-scale model for contour completion based on image statistics. The boundaries of human segmented images are used as "ground truth". A prob...
Xiaofeng Ren, Jitendra Malik
ICIP
2007
IEEE
16 years 6 months ago
Large Scale Learning of Active Shape Models
We propose a framework to learn statistical shape models for faces as piecewise linear models. Specifically, our methodology builds upon primitive active shape models(ASM) to hand...
Atul Kanaujia, Dimitris N. Metaxas
« Prev « First page 1086 / 1530 Last » Next »