Sciweavers

1760 search results - page 263 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
CPAIOR
2007
Springer
14 years 2 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
IACR
2011
73views more  IACR 2011»
12 years 7 months ago
Secure Authentication from a Weak Key, Without Leaking Information
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
Niek J. Bouman, Serge Fehr
CF
2010
ACM
13 years 11 months ago
Hybrid parallel programming with MPI and unified parallel C
The Message Passing Interface (MPI) is one of the most widely used programming models for parallel computing. However, the amount of memory available to an MPI process is limited ...
James Dinan, Pavan Balaji, Ewing L. Lusk, P. Saday...
BMCBI
2007
156views more  BMCBI 2007»
13 years 8 months ago
Bio: : NEXUS: a Perl API for the NEXUS format for comparative biological data
Background: Evolutionary analysis provides a formal framework for comparative analysis of genomic and other data. In evolutionary analysis, observed data are treated as the termin...
Thomas Hladish, Vivek Gopalan, Chengzhi Liang, Wei...
CDC
2008
IEEE
171views Control Systems» more  CDC 2008»
14 years 2 months ago
Constrained optimal control theory for differential linear repetitive processes
Abstract. Differential repetitive processes are a distinct class of continuous-discrete twodimensional linear systems of both systems theoretic and applications interest. These pr...
Michael Dymkov, Eric Rogers, Siarhei Dymkou, Krzys...