7015 search results - page 994 / 1403 » Approximation algorithms for co-clustering |
216
click to vote
HICSS
2008
IEEE
15 years 7 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
189
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
230
click to vote
AMAI
2008
Springer
15 years 7 months ago
2008
Springer
This paper presents and evaluates an approach to Bayesian model averaging where the models are Bayesian nets (BNs). Prior distributions are defined using stochastic logic programs...
167
click to vote
CGF
2008
15 years 6 months ago
2008
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
154
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...