1058 search results - page 19 / 212 » It's Doomed; We Can Prove It |
193
click to vote
CORR
2011
Springer
14 years 10 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...
155
click to vote
ITCC
2005
IEEE
16 years 7 days 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...
150
click to vote
SIAMDM
2008
15 years 6 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...
287
click to vote
ESOP
2011
Springer
14 years 10 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...
234
click to vote
INFOCOM
2011
IEEE
14 years 10 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...