نتایج جستجو برای: CCR . K
تعداد نتایج: 382076 فیلتر نتایج به سال:
In this paper we investigate the inverse protein folding (IPF) problem under the Canonical model on 3D and 2D lattices [13, 26]. In this problem, we are given a contact graph G = (V,E) of a protein sequence that is embeddable in a 3D (respectively, 2D) lattice and an integer 1 ≤ K ≤ |V |. The goal is to find an induced subgraph of G of at most K vertices with the maximum number of edges. In thi...
A new ensemble dimension reduction regression technique, called Correlated Component Regression (CCR), is proposed that predicts the dependent variable based on K correlated components. For K = 1, CCR is equivalent to the corresponding Naïve Bayes solution, and for K = P, CCR is equivalent to traditional regression with P predictors. An optional step-down variable selection procedure provides a...
Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented. Both its theoretical and practical variants improve the known algorithms . • Work supported in part by NSF Grants CCR-86-05353 and CCR-88-14977 1 Department of Computer Science, Columbia University, New York, NY 10...
We study a generalization of covering problems called partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard covering problems. For example, in k-partial set cover, we wish to choose a minimum number of sets to cover at least k elements. For k-partial set cover, if each element occurs in at most f sets, then we derive a primal...
Superconducting joints are one of the key technologies to make Ba1-xKxFe2As2 (Ba-122) superconducting wires or tapes for high-field applications. Herein, were fabricated by a simple cold-pressing method, and joint resistance iron-based was estimated first time. The properties, microstructures, elements distribution in regions investigated. At 4.2 K 10 T, transport critical current Ic 105 A obta...
Data Envelopment Analysis (DEA) is a mathematical programming approach to assess relative efficiencies with a group of decision making units (DMUs) such as production systems. There have been some useful models for their successful applications in many fields. In this paper, we first point out the defect of the first DEA model CCR (Charnes, Cooper and Rhodes, 1978) in measuring the efficiencies...
The COCOLOG (Conditional Observer and Controller Logic) system is a partially ordered family of rst order logical theories expressed in the typed rst order languages fL k ; k 0g describing the controlled evolution of the state of a given partially observed nite machine M. The initial theory of the system, denoted Th 0 , gives the theory of M with no data being given on the initial state. Later ...
Although largely unnoticed by the online algorithms community, T-theory, a field of discrete mathematics, has contributed to the development of several online algorithms for the k-server problem. A brief summary of the k-server problem, and some important application concepts of T-theory, are given. Additionally, a number of known k-server results are restated using the established terminology ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید