Sciweavers

265 search results - page 14 / 53
» et 2000
Sort
View
ETS
2002
IEEE
105views Hardware» more  ETS 2002»
13 years 7 months ago
Academics in Academia: the Forgotten Resource in the Rush to New Technologies
Suffice to say that I'm leaving in large part because it's not much fun any more, and the directions of the university are not mine. I'm not the first, and I won�...
Tim S. Roberts
JCO
2000
116views more  JCO 2000»
13 years 7 months ago
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
Piotr Berman, Bhaskar DasGupta
IJCAI
2003
13 years 9 months ago
On a generalization of triangulated graphs for domains decomposition of CSPs
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
Assef Chmeiss, Philippe Jégou, Lamia Keddar
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
13 years 12 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
RECOMB
2000
Springer
13 years 11 months ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal