Results 1 - 10 of 920

On the Parameterized Complexity of Pooling Design

by Yongxi Cheng, Ding-zhu Du, Ker-i Ko, Guohui Lin
"... Pooling design is a very helpful tool for reducing the number of tests in DNA library screening, which is a key process to obtain high-quality DNA libraries for studying gene functions. Three basic problems in pooling design are, given an m n binary matrix and a positive integer d, to decide whether ..."
Abstract - Add to MetaCart
screening, parameterized complexity, pooling designs, separable matrices.

Parameterized Complexity

by Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen , 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms | a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract - Cited by 1213 (77 self) - Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms | a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs

On understanding types, data abstraction, and polymorphism

by Luca Cardelli, Peter Wegner - ACM COMPUTING SURVEYS , 1985
"... Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the relevance of recent research to the design of practical programming languages. Object-oriented languag ..."
Abstract - Cited by 845 (13 self) - Add to MetaCart
Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the relevance of recent research to the design of practical programming languages. Object

VL2: Scalable and Flexible Data Center Network”,

by Albert Greenberg , James R Hamilton , Navendu Jain , Srikanth Kandula , Changhoon Kim , Parantap Lahiri , David A Maltz , Parveen Patel , Sudipta Sengupta - ACM SIGCOMM Computer Communication Review, , 2009
"... Abstract To be agile and cost e ective, data centers should allow dynamic resource allocation across large server pools. In particular, the data center network should enable any server to be assigned to any service. To meet these goals, we present VL, a practical network architecture that scales t ..."
Abstract - Cited by 461 (12 self) - Add to MetaCart
paths, and () end-system based address resolution to scale to large server pools, without introducing complexity to the network control plane. VL's design is driven by detailed measurements of tra c and fault data from a large operational cloud service provider. VL's implementation

Parameterized

by Wu Ye, Ruoyu Liang
"... Abstract: Gives the method of 3D CAD parametric design under the guidance of the theory of reverse engineering. Describes the application of the method development process of complex-shaped surface mold. Analysis of the mold characteristics, coordinate measuring equipment accurate and efficient acc ..."
Abstract - Add to MetaCart
Abstract: Gives the method of 3D CAD parametric design under the guidance of the theory of reverse engineering. Describes the application of the method development process of complex-shaped surface mold. Analysis of the mold characteristics, coordinate measuring equipment accurate and efficient

Learning mid-level features for recognition

by Y-lan Boureau, Francis Bach, Yann LeCun, Jean Ponce , 2010
"... Many successful models for scene or object recognition transform low-level descriptors (such as Gabor filter responses, or SIFT descriptors) into richer representations of intermediate complexity. This process can often be broken down into two steps: (1) a coding step, which performs a pointwise tra ..."
Abstract - Cited by 228 (13 self) - Add to MetaCart
Many successful models for scene or object recognition transform low-level descriptors (such as Gabor filter responses, or SIFT descriptors) into richer representations of intermediate complexity. This process can often be broken down into two steps: (1) a coding step, which performs a pointwise

Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability

by Rodney G. Downey, Michael R. Fellows, Ulrike Stege - DIMACS Series in Discrete Mathematics and Theoretical Computer Science , 1997
"... In this paper we give a programmatic overview of parameterized computational complexity in the broad context of the problem of coping with computational intractability. We give some examples of how fixed-parameter tractability techniques can deliver practical algorithms in two different ways: (1) by ..."
Abstract - Cited by 87 (16 self) - Add to MetaCart
In this paper we give a programmatic overview of parameterized computational complexity in the broad context of the problem of coping with computational intractability. We give some examples of how fixed-parameter tractability techniques can deliver practical algorithms in two different ways: (1

Parameterized Complexity: The Main Ideas and Connections to Practical Computing

by Michael R. Fellows , 2002
"... The purposes of this paper are two: (1) to give an exposition of the main ideas of parameterized complexity, and (2) to discuss the connections of parameterized complexity to the systematic design of heuristics and approximation algorithms. ..."
Abstract - Cited by 25 (6 self) - Add to MetaCart
The purposes of this paper are two: (1) to give an exposition of the main ideas of parameterized complexity, and (2) to discuss the connections of parameterized complexity to the systematic design of heuristics and approximation algorithms.

Parameterized approximation problems

by Rod Downey, Mike Fellows, Catherine Mccartin - In Parameterized and Exact Computation, Second International Workshop, IWPEC 2006 , 2006
"... Parameterized complexity is fast becoming accepted as an important strand in the mainstream of algorithm design and analysis, alongside approximation, randomization, and the like. It is fair to say that most of the work in the area has focussed on exact algorithms for decision problems. On the other ..."
Abstract - Cited by 22 (1 self) - Add to MetaCart
Parameterized complexity is fast becoming accepted as an important strand in the mainstream of algorithm design and analysis, alongside approximation, randomization, and the like. It is fair to say that most of the work in the area has focussed on exact algorithms for decision problems

The Parameterized Complexity of Enumerating Frequent Itemsets ⋆

by Matthew Hamilton, Rhonda Chaytor, Todd Wareham
"... Abstract. A core problem in data mining is enumerating frequentlyoccurring itemsets in a given set of transactions. The search and enumeration versions of this problem have recently been proven NP-and #P-hard, respectively (Gunopulos et al, 2003) and known algorithms all have running times whose exp ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
exponential terms are functions of either the size of the largest transaction in the input and/or the largest itemset in the output. In this paper, we analyze the complexity of the size-k frequent itemset enumeration problem relative to a variety of parameterizations. Many of our hardness results are proved
Results 1 - 10 of 920