6315 search results - page 449 / 1263 » Approximating Solution Structure |
210
click to vote
PVLDB
2010
15 years 6 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
224
click to vote
SIAMSC
2010
15 years 6 months ago
2010
In this article we consider the a posteriori error estimation and adaptive mesh refinement of discontinuous Galerkin finite element approximations of the hydrodynamic stability p...
215
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
—The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is...
198
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
231
click to vote
PVLDB
2011
15 years 2 months ago
2011
Matching problems are ubiquitous. They occur in economic markets, labor markets, internet advertising, and elsewhere. In this paper we focus on an application of matching for soci...