4843 search results - page 405 / 969 » The Shortcut Problem - Complexity and Approximation |
164
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
112
Voted
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
156
click to vote
ICCAD
2009
IEEE
15 years 2 months ago
2009
IEEE
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...
131
click to vote
ICIP
2003
IEEE
16 years 6 months ago
2003
IEEE
In this paper the blind image deconvolution (BID) problem is solved using the Bayesian framework. In order to find the parameters of the proposed Bayesian model we present a new g...
244
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...