448 search results - page 62 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
In this paper we present a generative model and learning procedure for unsupervised video clustering into scenes. The work addresses two important problems: realistic modeling of ...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
TIP
2008
13 years 7 months ago
2008
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
CPM
2006
Springer
13 years 11 months ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...