Sciweavers

87 search results - page 11 / 18
» Combinatorial Complexity of Convex Sequences
Sort
View
ICPADS
2008
IEEE
14 years 1 months ago
Parallel Large Scale Inference of Protein Domain Families
The resolution of combinatorial assortments of protein sequences into domains is a prerequisite for protein sequence interpretation. However the recognition and clustering of homo...
Daniel Kahn, Clément Rezvoy, Fréd&ea...
ECCC
2000
113views more  ECCC 2000»
13 years 7 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich
DISOPT
2011
201views Education» more  DISOPT 2011»
12 years 11 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
BMCBI
2010
167views more  BMCBI 2010»
13 years 7 months ago
Inference of sparse combinatorial-control networks from gene-expression data: a message passing approach
Background: Transcriptional gene regulation is one of the most important mechanisms in controlling many essential cellular processes, including cell development, cell-cycle contro...
Marc Bailly-Bechet, Alfredo Braunstein, Andrea Pag...
JDCTA
2010
272views more  JDCTA 2010»
13 years 2 months ago
Optimal Control of Nonlinear Systems Using the Homotopy Perturbation Method: Infinite Horizon Case
This paper presents a new method for solving a class of infinite horizon nonlinear optimal control problems. In this method, first the original optimal control problem is transfor...
Amin Jajarmi, Hamidreza Ramezanpour, Arman Sargolz...