1058 search results - page 19 / 212 » It's Doomed; We Can Prove It |
CORR
2011
Springer
13 years 1 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
ITCC
2005
IEEE
14 years 3 months ago
2005
IEEE
Hypergraphs are a very powerful tool and can represent many problems. In this paper we define a new image representation based on hypergraphs. This representation conducts to a n...
SIAMDM
2008
13 years 9 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
ESOP
2011
Springer
13 years 1 months ago
2011
Springer
We develop and prove sound a concurrent separation logic for a language with Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is...
INFOCOM
2011
IEEE
13 years 1 months ago
2011
IEEE
Abstract—Triangulation serves as the basis for many geometrybased algorithms in wireless sensor networks. In this paper we propose a distributed algorithm that produces a triangu...