Results 1  10
of
3,366
Parameterized Complexity
, 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
into the toolkit of every algorithm designer. The purpose of the seminar was to bring together leading experts from all over the world, and from the diverse areas of computer science that have been attracted to this new framework. The seminar was intended as the rst larger international meeting with a specic focus
Black Hole Entropy Function, Attractors and Precision Counting of Microstates
, 2007
"... In these lecture notes we describe recent progress in our understanding of attractor mechanism and entropy of extremal black holes based on the entropy function formalism. We also describe precise computation of the microscopic degeneracy of a class of quarter BPS dyons in N = 4 supersymmetric strin ..."
Abstract

Cited by 324 (28 self)
 Add to MetaCart
In these lecture notes we describe recent progress in our understanding of attractor mechanism and entropy of extremal black holes based on the entropy function formalism. We also describe precise computation of the microscopic degeneracy of a class of quarter BPS dyons in N = 4 supersymmetric
Optimal alignments in linear space
 CABIOS
, 1988
"... Space, not time, is often the limiting factor when computing optimal sequence alignments, and a number of recent papers in the biology literature have proposed spacesaving strategies. However, a 1975 computer science paper by Hirschberg presented a method that is superior to the newer proposals, bo ..."
Abstract

Cited by 292 (4 self)
 Add to MetaCart
Space, not time, is often the limiting factor when computing optimal sequence alignments, and a number of recent papers in the biology literature have proposed spacesaving strategies. However, a 1975 computer science paper by Hirschberg presented a method that is superior to the newer proposals
Functional Data Structures
, 1996
"... this paper. Note that the cons operation supplied by this library is strict, not lazy. In fact, the only lazy operations in this library are ++ (infix append) and reverse. 2 FIFO Queues Stacks and queues are usually the first two data structures studied by beginning computer science students. The ty ..."
Abstract

Cited by 283 (4 self)
 Add to MetaCart
this paper. Note that the cons operation supplied by this library is strict, not lazy. In fact, the only lazy operations in this library are ++ (infix append) and reverse. 2 FIFO Queues Stacks and queues are usually the first two data structures studied by beginning computer science students
Lecture Notes in Computer Science
, 1997
"... . This paragraph shall summarize the contents of the paper in short terms. 1 FixedPeriod Problems: The Sublinear Case With this chapter, the preliminaries are over, and we begin the search for periodic solutions . . . 1.1 Autonomous Systems In this section we will consider the case when the Hamilt ..."
Abstract
 Add to MetaCart
the Hamiltonian H(x) . . . The General Case: Nontriviality. We assume that H is (A1 ; B1 )subquadratic at infinity, for some constant . . . Notes and Comments. The first results on subharmonics were . . . Proposition 4. Assume H 0 (0) = 0 and H(0) = 0. Set . . . Proof of proposition. Condition (8) means that
Lecture Notes in Computer Science
"... . This paragraph shall summarize the contents of the paper in short terms. 1 FixedPeriod Problems: The Sublinear Case With this chapter, the preliminaries are over, and we begin the search for periodic solutions : : : 1.1 Autonomous Systems In this section we will consider the case when the Hamilto ..."
Abstract
 Add to MetaCart
the Hamiltonian H(x) : : : The General Case: Nontriviality. We assume that H is (A1 ; B1 )subquadratic at infinity, for some constant : : : Notes and Comments. The first results on subharmonics were : : : Proposition 4. Assume H 0 (0) = 0 and H(0) = 0. Set : : : Proof of proposition. Condition (8) means that
). (Lecture Notes in Computer Science)
"... Abstract. The automatic recognition of symbols can be used to automatically convert scanned drawings into digital representations compatible with computer aided design software. We propose a novel approach to automatically recognize architectural and electrical symbols. The proposed method extends ..."
Abstract
 Add to MetaCart
Abstract. The automatic recognition of symbols can be used to automatically convert scanned drawings into digital representations compatible with computer aided design software. We propose a novel approach to automatically recognize architectural and electrical symbols. The proposed method extends
Constructivism in Computer Science Education
 Center for Research on Learning and Teaching, University of Michigan
, 1998
"... Constructivism is a theory of learning which claims that students construct knowledge rather than merely recieve and store knowledge transmitted by the teacher. Constructivism has been extremely influential in science and mathematics education, but much less so in computer science education (CSE). T ..."
Abstract

Cited by 170 (9 self)
 Add to MetaCart
Constructivism is a theory of learning which claims that students construct knowledge rather than merely recieve and store knowledge transmitted by the teacher. Constructivism has been extremely influential in science and mathematics education, but much less so in computer science education (CSE
Lambda Lifting: Transforming Programs to Recursive Equations
, 1985
"... Lambda lifting is a technique for transforming a functional program with local function definitions, possibly with free variables in the function definitions, into a program consisting only of global function (combinator) definitions which will be used as rewrite rules. Different ways of doing lambd ..."
Abstract

Cited by 218 (4 self)
 Add to MetaCart
and Computer Architecture, Lecture Notes in Computer Science 201, Nancy, France, 1985. Springer Verlag. y As part B of author's thesis. Main addition: the attribute grammar formulation. 1 Introduction When compiling a lazy functional language using the technique described in [Joh84] it is presumed
Class for Lecture Notes in Computer Science
"... . This paragraph shall summarize the contents of the paper in short terms. 1 FixedPeriod Problems: The Sublinear Case With this chapter, the preliminaries are over, and we begin the search for periodic solutions . . . 1.1 Autonomous Systems In this section we will consider the case when the Hamilt ..."
Abstract
 Add to MetaCart
the Hamiltonian H(x) . . . The General Case: Nontriviality. We assume that H is (A1 ; B1 )subquadratic at infinity, for some constant . . . Notes and Comments. The first results on subharmonics were . . . Proposition 1. Assume H 0 (0) = 0 and H(0) = 0. Set . . . Proof (of proposition). Condition (8) means
Results 1  10
of
3,366