Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate...
d Abstract) LYDIA E. KAVRAKI JEAN-CLAUDE LATOMBE RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...
Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motw...