1227 search results - page 200 / 246 » Approximate Kernel Clustering |
117
click to vote
UAI
2008
15 years 5 months ago
2008
Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal langu...
143
click to vote
ECIR
2004
Springer
15 years 5 months ago
2004
Springer
We simulate different architectures of a distributed Information Retrieval system on a very large Web collection, in order to work out the optimal setting for a particular set of r...
124
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
128
click to vote
TOG
2010
14 years 11 months ago
2010
This paper introduces a method for optimizing the tiles of a quadmesh. Given a quad-based surface, the goal is to generate a set of K quads whose instances can produce a tiled sur...
155
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....