Sciweavers

1227 search results - page 200 / 246
» Approximate Kernel Clustering
Sort
View
UAI
2008
14 years 11 months ago
Church: a language for generative models
Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal langu...
Noah Goodman, Vikash K. Mansinghka, Daniel M. Roy,...
ECIR
2004
Springer
14 years 11 months ago
Performance Analysis of Distributed Architectures to Index One Terabyte of Text
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...
Fidel Cacheda, Vassilis Plachouras, Iadh Ounis
CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 10 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
TOG
2010
64views more  TOG 2010»
14 years 4 months ago
K-set tilable surfaces
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...
Chi-Wing Fu, Chi-Fu Lai, Ying He 0001, Daniel Cohe...
CVPR
2011
IEEE
14 years 1 months ago
Entropy Rate Superpixel Segmentation
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....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...