Sciweavers

9842 search results - page 1371 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
CP
2009
Springer
16 years 7 months ago
Constraints of Difference and Equality: A Complete Taxonomic Characterisation
Abstract. Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, i...
Emmanuel Hebrard, Dániel Marx, Barry O'Sull...
EUROCRYPT
2009
Springer
16 years 7 months ago
A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
Recently, at Crypto 2008, Boneh, Halevi, Hamburg, and Ostrovsky (BHHO) solved the longstanding open problem of "circular encryption," by presenting a public key encrypti...
Jan Camenisch, Nishanth Chandran, Victor Shoup
CHI
2005
ACM
16 years 7 months ago
Blind learners programming through audio
The development of programming skills is a motivating issue in computer science. Programming languages have been increasingly used to map end-users needs and mental models. The nu...
Jaime Sánchez, Fernando Aguayo
VLSID
2002
IEEE
177views VLSI» more  VLSID 2002»
16 years 7 months ago
RTL-Datapath Verification using Integer Linear Programming
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
Raik Brinkmann, Rolf Drechsler
RECOMB
2008
Springer
16 years 7 months ago
Perfect DCJ Rearrangement
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...
Sèverine Bérard, Annie Chateau, Cedr...
« Prev « First page 1371 / 1969 Last » Next »