369 search results - page 44 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
108
click to vote
WWW
2006
ACM
16 years 13 days ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
144
click to vote
OL
2011
14 years 6 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
TSP
2008
14 years 11 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
ESANN
2007
15 years 1 months ago
2007
Abstract. The convex optimisation problem involved in fitting a kernel probit regression (KPR) model can be solved efficiently via an iteratively re-weighted least-squares (IRWLS)...
148
Voted
STOC
2007
ACM
16 years 2 days ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...