2430 search results - page 419 / 486 » Computing Tutte Polynomials |
131
Voted
JCT
2011
14 years 9 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
122
click to vote
MST
2010
14 years 9 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
128
Voted
TSMC
2010
14 years 9 months ago
2010
We study how the dependence of a simulation output on an uncertain parameter can be determined, when simulations are computationally expensive and so can only be run for very few p...
108
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, we study the eigenvalue-based spectrum sensing techniques for multiple-antenna cognitive radio networks. First, we study the extreme eigenvalue distributions of a c...
111
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper considers the problem of low complexity implementation of high-performance semidefinite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...