Object detection is always conducted by object proposal generation and classification
sequentially. This paper handles object detection in a superpixel oriented manner instead of …

The central concept of theorem designates a claim backed by an irrefutable argument that
follows formal rules, called a proof. Proving theorems is very useful in both Computer …

The construction of a theory for binary trees is presented, based on the systematic
exploration of the properties necessary for the proof-based synthesis and certification of …

In the frame of our previous experiments for proof based synthesis of sorting algorithms for
lists and for binary trees, we employed certain special techniques which are able to …

Одним из декларируемых преимуществ функциональных языков программирования
является простота преобразований, а также формулирования и доказательства …

Logic, the language and art of formal reasoning, is very useful in both Computer Science
and Mathematics. Both require correct, unambiguous argumentation to support claims; the …

Résumé Les preuves par récurrence sont parfaitement adaptées au raisonnement sur des
structures de données non-bornées, comme par exemple les entiers et les listes, ou, de …