1538 search results - page 66 / 308 » Spectral Techniques in Graph Algorithms |
112
click to vote
DAC
2000
ACM
16 years 2 months ago
2000
ACM
The proliferation of the Internet has a ected the business model of almost all semiconductor and VLSI CAD companies that rely on intellectual property (IP) as their main source of...
100
click to vote
JMLR
2010
14 years 8 months ago
2010
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
119
click to vote
DIALM
2000
ACM
15 years 5 months ago
2000
ACM
The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless c...
130
click to vote
ICDM
2009
IEEE
14 years 11 months ago
2009
IEEE
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
GD
1995
Springer
15 years 5 months ago
1995
Springer
Abstract. When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightn...