25041 search results - page 4289 / 5009 » Algorithms for Clustering Data |
172
Voted
POPL
2012
ACM
14 years 2 months ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
218
Voted
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
217
Voted
TOG
2012
13 years 9 months ago
2012
We present a method for recovering a temporally coherent, deforming triangle mesh with arbitrarily changing topology from an incoherent sequence of static closed surfaces. We solv...
217
click to vote
TOG
2012
13 years 9 months ago
2012
Compositing is one of the most commonly performed operations in computer graphics. A realistic composite requires adjusting the appearance of the foreground and background so that...
208
Voted
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...