WorldCat Identities

University of California, Berkeley Computer Science Division

Overview
Works: 381 works in 412 publications in 1 language and 614 library holdings
Genres: Academic theses  Handbooks and manuals 
Classifications: TK7885.A1, 512.50285
Publication Timeline
.
Most widely held works about University of California, Berkeley
 
moreShow More Titles
fewerShow Fewer Titles
Most widely held works by University of California, Berkeley
Report by Berkeley University of California( )

in English and Undetermined and held by 16 WorldCat member libraries worldwide

Parallel numerical linear algebra by James W Demmel( Book )

2 editions published between 1992 and 1993 in English and held by 11 WorldCat member libraries worldwide

The differencing method of set partitioning by Narendra Karmarkar( Book )

1 edition published in 1982 in English and held by 8 WorldCat member libraries worldwide

A new interface specification methodology and its application to transducer synthesis by Gaetano Borriello( Book )

2 editions published in 1988 in English and held by 8 WorldCat member libraries worldwide

Janus uses a novel approach, based on a small set of templates, to synthesize mixed asynchronous and synchronous control logic. The synthesis algorithm, called Suture, first constructs a skeletal circuit and then locally modifies the design to meet interface timing constraints and eliminate internal race conditions. Optimizations of the resulting sequential logic yield transducers that are compatible in both size and performance to those generated by experienced designers. Three practical examples are used to demonstrate this result
A study of the parametric uniform B-spline curve and surface representations by Brian A Barsky( Book )

2 editions published in 1983 in English and held by 8 WorldCat member libraries worldwide

This paper explains the parametric uniform B-spline curve and surface representations. The parametric representation is discussed, the properties of the B-spline basis functions is presented. Various end conditions and boundary conditions are described in order to enable the B-spline user to select which of the many options would be appropriate for a particular application. Efficient algorithms are designed and analyzed for B-spline basis function evaluation, and for the evaluation and perturbation of both B-spline curves and surfaces. Finally, difference techniques to accomplish this are also developed
Performance analysis of several backend database architectures by Berkeley University of California( Book )

2 editions published in 1983 in English and held by 7 WorldCat member libraries worldwide

With the growing acceptance of database systems, the performance of these systems becomes increasingly more important. One way to gain performance is to off-load some of the functions of the database system to a backend computer. The problem is what functions should be off-loaded to maximize the benefits of distributed processing
Two problems in concrete complexity : cycle detection and parallel prefix computation by Faith Ellen( )

2 editions published in 1982 in English and held by 7 WorldCat member libraries worldwide

The cycle detection problem is to find a repetition in the sequence obtained by applying a function repeatedly to a starting value in its domain. Structural properties of cycle detection algorithms and lower bounds on the number of function evaluations they perform are obtained under the assumption that there is a bound on the amount of memory available. For several classes of algorithms, including those which use two memory locations, optimal or near optimal results are achieved
The condition number of similarities that diagonalize matrices by James W Demmel( Book )

1 edition published in 1983 in English and held by 7 WorldCat member libraries worldwide

How ill-conditioned must a matrix S be if it (block) diagonalizes a given matrix T, i.e. if S -1 TS is block diagonal? The answer depends on how the diagonal blocks partition T's spectrum; the condition number of S is bounded below by a function of the norms of the projection matrices determined by the partitioning. In the case of two diagonal blocks we compute an S which attains this lower bound, and we describe almost best conditioned S's for dividing T into more blocks. We apply this result to bound the error in an algorithms to compute analytic functions of matrices, for instance exp(T). Our techniques also produce bounds for submatrices that appear in the square-root-free Choleskt and in the Gram-Schmidt orthogonalization algorithms
Crystal, a timing analyzer for nMOS VLSI circuits by John K Ousterhout( Book )

1 edition published in 1983 in English and held by 7 WorldCat member libraries worldwide

Crystal is a timing analyzer for nMOS circuits designed in the Mead-Conway style. Based on the circuit extracted from a mask set, Crystal determines the length of each clock phase and pinpoints the longest paths. The analysis is independent of specific data values and uses critical path techniques along with s simple RC model of delays. Several additional techniques are used to improve the speed and accuracy of the program, including separate up/down timing, static level assignment, flow control for pass transistors, and precharging
Process migration in DEMOS/MP by Michael L Powell( Book )

1 edition published in 1983 in English and held by 7 WorldCat member libraries worldwide

A number of characteristics of DEMOS/MP allowed process migration to be implemented efficiently and with no changes to system services. Among these characteristics are the uniform and location independent communication interface, and the fact that the kernel can participate in message send and receive operations in the same manner as a normal process
Inverse currying transformation on attribute grammars by R Wilhelm( Book )

1 edition published in 1983 in English and held by 7 WorldCat member libraries worldwide

Inverse currying transformation of an attribute grammar moves a context condition to places in the grammar where the violation of the condition can be detected as soon as the semantic information used in the condition is computed. It thereby takes into account the evaluation order chosen for the attribute grammar. Inverse currying transformations can be used to enhance context sensitive parsing using predicates on attributes, to eliminate sources of backtrack when parsing according to ambiguous grammars, and to facilitate semantics-supported error correction
An interval algorithm for solving systems of linear equations to prespecified accuracy by James W Demmel( Book )

1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide

We describe an interval arithmetic algorithm for solving a special class of simulataneous linear equations. This class includes but is not limited to systems Ax=b where A and b have integer entries. The algorithm uses fixed point arithemetic, and has two properties which distinguish it from earlier algorithms: given the absolute accuracy e desired, the algorithm uses only as much precision as needed to achieve it, and the algorithm can adjust its own parameters to minimize computation time
The design and assessment of a hypermedia course on semiconductor manufacturing by Patricia K Schank( Book )

1 edition published in 1993 in English and held by 6 WorldCat member libraries worldwide

This article describes the design and evaluation of an IC-HIP, a multimedia course on integrated circuit manufacturing (Schank & Rowe, 1992). Subjects browsed the course via standard hypermedia links or linear paths. Learning effects were assessed based on navigation method (hyperlinks vs. path), prior knowledge (low vs. high), and other factors (e.g., subjects' stated interests in semiconductors, and kinds and number of course nodes viewed (by media type and topic area), were also assessed. Results suggest that subjects who browsed via hypermedia links tended to more often bridge topic areas rather than explore them in depth, but there were little or no learning differences by knowledge or navigation group, and neither prior interest nor nodes viewed (by number, topic area, or media type) were correlated with learning. These results and future work are discussed
A simplified version of H.W. Lenstra's integer programming algorithm and some applications by A Paz( Book )

1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide

A very interesting algorithm has been recently suggested by H.W. Lenstra, Jr. [1] for solving integer programming problems. One part of that algorithm was further improved in [2]. The algorithm was shown to be polynomial in the length of the input, for a fixed number of variables. On the other hand the algorithm is impractical for a large number of variables and its implementation is not clear even for a small number of variables. We suggest here a few simplifications and improvements to that algorithm, making its implementation easy (though still impractical for a great number of variables). As a byproduct we show how to solve diophantine linear equations over the nonnegative integers. For a small number of variables (3 or 4) a practical and fast algorithm for solving such equation results
Effects of underflow on solving linear systems by James W Demmel( Book )

1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide

In this paper we examine the effects of underflow on solving systems of linear equations using Gaussian Elimination. Our goal is to decide if reliable software for solving linear in the presence of underflow can be written at reasonable cost. We contrast the utilities of gradual underflow and "store zero", and show that only by using gradual underflow can we achieve reliability easily
A new Monte-Carlo method for estimating the failure probability of an n-component system by Richard M Karp( Book )

1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide

A new formula for the probability of a union of events is used to express the failure probability fo an n-component system. A very simple Monte-Carlo algorithm based on the new probability formula is presented. The input to the algorithm gives the failure probabilities of the n components of the system and a list of the failure sets of the system. The output is an unbiased estimator of the failure probability of the system. We show that the average value of the estimator over many runs of the algorthm tends to converge quickly to the failure Probability of the system. The overall time to estimate the failure probability with high accuracy compares very favorably with the execution times of other methods used for solving this problem
Database support for programming environments by Michael L Powell( Book )

1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide

In this paper, we show how to represent programs in the relational model and how traditional programming tasks such as symbol table management are simplified through use of a database. We suggest extensions to relational systems to support more efficient access of recursive data structures, queries involving transitive closure and allow application-specific detection of triggers. These extensions can be used for applications other than programming environments
A machine vision based surveillance system for California roads by J Malik( Book )

1 edition published in 1995 in English and held by 6 WorldCat member libraries worldwide

UNIX programmer's manual by K Thompson( Book )

3 editions published between 1979 and 1983 in English and held by 5 WorldCat member libraries worldwide

Evaluation of single and multiple processor office workstations by Robert David Selinger( )

2 editions published in 1983 in English and held by 5 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.78 (from 0.55 for UNIX progr ... to 0.92 for Evaluation ...)

Alternative Names

controlled identityUniversity of California, Berkeley

CSD

UCB CSD

University of California Berkeley, Calif Computer Science Division

University of California, Berkeley Computer Science Division

University of California, Berkeley Computer Sciences Division

University of California Berkeley Department of Electrical Engineering and Computer Science Computer Science Division

University of California, Berkeley. Department of Electrical Engineering and Computer Sciences. Computer Sciences Division

University of California, Berkeley. Dept. of Electrical Engineering and Computer Sciences. Computer Science Division

Languages
English (53)