Results 1  10
of
1,210,108
Linearly bounded infinite graphs
 ACTA INFORMATICA
, 2007
"... Linearly bounded Turing machines have been mainly studied as acceptors for contextsensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linea ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Linearly bounded Turing machines have been mainly studied as acceptors for contextsensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages
Synchronized Product of Linear Bounded Machines
 In FCT, volume 1684 of LNCS
, 1999
"... This paper introduces a class of graphs defined as the models of a peculiar kind of linear bounded machines that read their input performing all computations on work tapes. ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
This paper introduces a class of graphs defined as the models of a peculiar kind of linear bounded machines that read their input performing all computations on work tapes.
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 776 (28 self)
 Add to MetaCart
of the bilinear objective function under a monotonicity assumption, the polyhedrality of the solution set of a monotone XLCP, and an error bound result for a nondegenerate XLCP. We also present a finite, sequential linear programming algorithm for solving the nonmonotone XLCP.
Lambertian Reflectance and Linear Subspaces
, 2000
"... We prove that the set of all reflectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a wi ..."
Abstract

Cited by 514 (20 self)
 Add to MetaCart
We prove that the set of all reflectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a
Linear pattern matching algorithms
 IN PROCEEDINGS OF THE 14TH ANNUAL IEEE SYMPOSIUM ON SWITCHING AND AUTOMATA THEORY. IEEE
, 1972
"... In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear ti ..."
Abstract

Cited by 549 (0 self)
 Add to MetaCart
In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear
A Limited Memory Algorithm for Bound Constrained Optimization
 SIAM Journal on Scientific Computing
, 1994
"... An algorithm for solving large nonlinear optimization problems with simple bounds is described. ..."
Abstract

Cited by 557 (9 self)
 Add to MetaCart
An algorithm for solving large nonlinear optimization problems with simple bounds is described.
Broadcasting With Linearly Bounded Transmission Faults
"... We consider broadcasting with a linearly bounded number of transmission failures. For a constant parameter 0 < Î± < 1 we assume that at most Î±i faulty transmissions can occur during the first i time units of the communication process, for every natural number i. Every informed node can transm ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We consider broadcasting with a linearly bounded number of transmission failures. For a constant parameter 0 < Î± < 1 we assume that at most Î±i faulty transmissions can occur during the first i time units of the communication process, for every natural number i. Every informed node can
Depth first search and linear graph algorithms
 SIAM JOURNAL ON COMPUTING
, 1972
"... The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect ..."
Abstract

Cited by 1384 (19 self)
 Add to MetaCart
of an undirect graph are presented. The space and time requirements of both algorithms are bounded by k 1V + k2E d k for some constants kl, k2, and k a, where Vis the number of vertices and E is the number of edges of the graph being examined.
Automatic Discovery of Linear Restraints Among Variables of a Program
, 1978
"... The model of abstract interpretation of programs developed by Cousot and Cousot [2nd ISOP, 1976], Cousot and Cousot [POPL 1977] and Cousot [PhD thesis 1978] is applied to the static determination of linear equality or inequality invariant relations among numerical variables of programs. ..."
Abstract

Cited by 733 (47 self)
 Add to MetaCart
The model of abstract interpretation of programs developed by Cousot and Cousot [2nd ISOP, 1976], Cousot and Cousot [POPL 1977] and Cousot [PhD thesis 1978] is applied to the static determination of linear equality or inequality invariant relations among numerical variables of programs.
Results 1  10
of
1,210,108