136 search results - page 6 / 28 » A Polynomial-Time Algorithm for Global Value Numbering |
119
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract--In this paper, the sum capacity of the Gaussian Multiple Input Multiple Output (MIMO) Cognitive Radio Channel (MCC) is expressed as a convex problem with finite number of...
VLDB
1998
ACM
15 years 6 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
122
Voted
AI
2011
Springer
14 years 5 months ago
2011
Springer
Although propositional satisfiability (SAT) is NP-complete, state-of-the-art SAT solvers are able to solve large, practical instances. The concept of backdoors has been introduced...
146
click to vote
CVPR
1998
IEEE
16 years 3 months ago
1998
IEEE
We propose a methodfor segmenting gray-value images. By segmentation, we mean a map from the set of pixels to a small set of levels such that each connected component of the set o...
112
click to vote
CCCG
2010
15 years 3 months ago
2010
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q...