Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Topic List  Advanced Search  
Sample search results for: a-v block complicated

Page:   2  3  4  5 
 
1 SAT Solver Attacks on Hash Functions
 

Summary:  . #12;CNF for the Round Function XOR - (~A v ~B v ~C) (A v B v ~C) (A v ~B v C) (~A v B v C) AND - (~A... v ~B v C) (~A v B v ~C) ...

  

Source: Kaminsky, Alan - Department of Computer Science, Rochester Institute of Technology

 

Collection: Computer Technologies and Information Sciences

 
2 Block Krylov-Schur Method for Large Symmetric Eigenvalue Problems
 

Summary:  the rank deficient case Implementations of block methods are more complicated than their non-block... Anal. Appl. 15, 228­272. 11. Knyazev, A. V.: 2001, `Toward the Optimal Preconditioned Eigensolver: Lo... . Knyazev, A. V. and K. Neymeyr: 2003, ...

  

Source: Zhou, Yunkai - Department of Mathematics, Southern Methodist University

 

Collection: Computer Technologies and Information Sciences

 
3 Massachusetts Institute of Technology CACHET: An Adaptive Cache Coherence Protocol for
 

Summary:  make Ca- 1 #12;Processor Rules Rule Name Instruction Cstate Action Next Cstate CRF-Loadl Loadl(a) Cell(a,v... ,Clean) retire Loadl Cell(a,v,Clean) Cell(a,v,Dirty) retire Loadl Cell(a,v,Dirty) CRF-Storel Storel(a,v) Cell... (a,-,Clean) retire Storel Cell(a,v,Dirty) ...

  

Source: Massachusetts Institute of Technology (MIT), Computer Science and Artificial Intelligence Laboratory, Computation Structures Group

 

Collection: Computer Technologies and Information Sciences

 
4 A Block-Based Robust Dependency Parser for Unrestricted Chinese Text,
 

Summary:  . Furthermore, it is clear to represent block with phrase structure, while it is rather complicated... in the lexicon, for example: ~ V/N/F/A //V: verb; N: noun; F: adverb; A: adjective A set of rules... . Then ATN network will use again to identify the complicated ...

  

Source: Association for Computational Linguistics (ACL) Anthology

 

Collection: Computer Technologies and Information Sciences

 
5 Applied Numerical Mathematics 58 (2008) 871883 www.elsevier.com/locate/apnum
 

Summary:  the bigger the savings. We discuss the somewhat complicated algorithmic details of this block-wise update... for the column pivoting. Let us denote by tn(A,r0) the dimension of Bn(A,r0), so that tn(A,v0) = n-1 i=0 si. Then... decomposition of block tridiagonal and block Hessenberg ...

  

Source: Gutknecht, Martin H. - Departement Mathematik, Eidgenössische Technische Hochschule Zürich (ETHZ)

 

Collection: Mathematics

 
6 Understanding Address Usage in the Visible Internet USC/ISI Technical Report ISI-TR-656, February 2009
 

Summary:  , BlockSizeId, taking an address-feature matrix 256 × (A, V, U ) and a given prefix length P. Since... clustered. In our case, each address is defined by its three features (A, V, U ), and the space is a number... by taking the median value of each observation: (A(b), V (b), U (b)) = ...

  

Source: Heidemann, John - Information Sciences Institute, University of Southern California

 

Collection: Computer Technologies and Information Sciences

 
7 Numer Algor (2008) 47:341359 DOI 10.1007/s11075-008-9192-9
 

Summary:  ; and blkcontrol=1 means that the block size can be increased when necessary. The seemingly complicated indexing... ­Schur method 2.1 Handling the rank deficient case Implementations of block methods are more complicated than... . Appl. 15, 228­272 (1994) 11. Knyazev, A.V.: Toward the ...

  

Source: Zhou, Yunkai - Department of Mathematics, Southern Methodist University

 

Collection: Computer Technologies and Information Sciences

 
8 Understanding Block-level Address Usage in the Visible Internet (Extended)
 

Summary:  an address-feature matrix 256×(A(a), V (a), U (a)) and a given prefix length P. Since the blocks in our sur... across different surveys and in differ- ent years (Appendix A), general characterization of the (A, V, U... clustered. In our case, each address is defined by its three ...

  

Source: Heidemann, John - Information Sciences Institute, University of Southern California

 

Collection: Computer Technologies and Information Sciences

 
9 3D Computer Vision Project Presentation , BLOCK MATCHING 1 3D Computer Vision
 

Summary:  3D Computer Vision ­ Project Presentation , BLOCK MATCHING 1 3D Computer Vision Project... Presentation BLOCK MATCHING Diesner, Erik Enderling, Heiko Gumz, Mathias Hoerning, Ronny Krueger, Franziska... Schumann, Christian #12;3D Computer Vision ­ Project Presentation , BLOCK MATCHING 2 Talk outline ·Block

  

Source: Enderling, Heiko - Center of Cancer Systems Biology, Tufts University

 

Collection: Biology and Medicine ; Mathematics

 
10 KleeQ: Asynchronous Key Management for Dynamic Ad-Hoc Networks
 

Summary:  Alice 1. Alice sends her version number vA = (vA 1 , . . . , vA n ) to Bob Bob 1. Bob computes... the difference between his version number and Alice's: v = vB - vA (v 1 , . . . , v n ) = (vB 1 - vA 1... - ber: v = vA - vB. 3. As above, Alice computes the set of Bob's ...

  

Source: Goldberg, Ian - School of Computer Science, University of Waterloo

 

Collection: Computer Technologies and Information Sciences

 
11 ABC -A New Framework for Block Ciphers Uri Avraham1 Eli Biham1 Orr Dunkelman2
 

Summary:  ABC - A New Framework for Block Ciphers Uri Avraham1 Eli Biham1 Orr Dunkelman2 1 Computer Science... , Israel. Email: orr.dunkelman@weizmann.ac.il Abstract. We suggest a new framework for block ciphers named... Advanced Block Cipher, or shortly ABC. ABC has additional non-secret parameters that ensure that each call

  

Source: International Association for Cryptologic Research (IACR) - Cryptology ePrint Archive

 

Collection: Multidisciplinary Databases and Resources

 
12 The Complexity of Compressing Subsegments of Images Described by Finite Automata
 

Summary:  v1 v4 v3 block(D,v4) block(C,v3) block X block(B,v2) block(A,v1) Figure 15: Regular block X cut o#11... ; from a basic block of T (as a matrix) can be treated as the sum: X = block(A; v1) + ...

  

Source: Rytter, Wojciech - Instytut Informatyki, Uniwersytet Warszawski

 

Collection: Computer Technologies and Information Sciences

 
13 Reentrant Arrhythmias and their Control in Models of Mammalian Cardiac Tissue
 

Summary:  .D. and A.V. Holden, Ph.D. April 15, 1999 Abstract We use detailed biophysical, and simplified models... 's approach to the theory of excitable media. Chaos, 1:303--334, 1991. [4] V. N. Biktashev and A. V. Holden... :211--217, 1995. [5] V. N. Biktashev and A. V. Holden. Re­entrant activity ...

  

Source: Biktashev, Vadim N. - Department of Mathematical Sciences, University of Liverpool

 

Collection: Mathematics

 
14 hal-00255954,version1-14Feb2008 Symposium on Theoretical Aspects of Computer Science 2008 (Bordeaux), pp. 645-656
 

Summary:  to the other two. It seems that they would require making Split block somewhat more complicated... -relational coarsest partition problem. References [1] Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The Design... . One instance represents the classical blocks and the other a partition of ...

  

Source: Ecole Polytechnique, Centre de mathématiques

 

Collection: Mathematics

 
15 Dealing With Linear Dependence during the Iterations of the Restarted Block Lanczos
 

Summary:  an orthonormal basis for the block Krylov subspace, Kb j(A, v1, . . . , vr) = span{v1, Av1, . . . , Aj-1 v1, v2... vk-1 + rkk p n=1 nAl vj] = Ai+1 [r1km(A)v1+. . .+rk-1km(A)vk-1]+rkk p n=1 nAl m(A)vj. Notice... Dealing With Linear Dependence during the Iterations of the Restarted Block ...

  

Source: Baglama, James - Department of Mathematics, University of Rhode Island

 

Collection: Mathematics

 
16 Symmetric Linearizations for Matrix Polynomials Nicholas J. Higham, D. Steven Mackey,
 

Summary:  description of all block symmetric pencils in L1(P), B(P) = L() = v1A v2A v2A v2B - v1C + v1B - v2A v1C v1C v... polynomials we show that every pencil in DL(P) is block symmetric and ...

  

Source: Tisseur, Francoise - Department of Mathematics, University of Manchester

 

Collection: Mathematics

 
17 Chaos and Fine Observables Constantin P. Niculescu
 

Summary:  subset of C. Proof. First notice that an equality of the form V (Fm (a)) = V (Fn (a)) with m; n 2 N... may assume the existence of an n 2 N? such that V (a) < V (F(a)) < ::: < V (Fn (a)) and V (Fn (a)) > V... at ...

  

Source: Niculescu, Constantin P. - Facultatea de Matematica-Informatica, Universitatea din Craiova

 

Collection: Mathematics

 
18 Maximum Flows by Incremental Breadth-First Search
 

Summary:  & Tarjan 86] Binary blocking flow method [Goldberg & Rao 97] O(min(n2/3m1/2)m log(n2/m) log U) time A.V... the algorithm more complicated We implement the simple version A.V. Goldberg (MSR-SVC) Incremental BFS 7... . Tarjan Renato F. Werneck Microsoft Research ­ Silicon Valley ...

  

Source: Narasayya, Vivek - Data Management, Exploration and Mining Group, Microsoft Research

 

Collection: Computer Technologies and Information Sciences

 
19 6.302 Feedback Systems Recitation 9: Minor-Loop in an Op-Amp
 

Summary:  for circuit (2) is (in the limit of large A): vO IIN - -RIN /z + -AIIN vO vO-A z IIN vI Diagram . Diagram 2... you a lot of tricks for understanding feedback systems when they are given to us as a block diagram... . Sometimes, getting a feedback system from its "physical" form as a schematic diagram to block ...

  

Source: Dawson, Joel - Microsystems Technology Laboratories & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

 

Collection: Engineering

 
20 Symmetric Linearizations for Matrix Polynomials Nicholas J. Higham, D. Steven Mackey,
 

Summary:  block symmetric pencils in L1(P): B(P) = L() = v1A v2A v2A v2B - v1C + v1B - v2A v1C v1C v2C : v C2... polynomials we show that every pencil in DL(P) is block symmetric and we obtain ...

  

Source: Higham, Nicholas J. - Department of Mathematics, University of Manchester

 

Collection: Mathematics


Page:   2  3  4  5 
Page:   1  2  3  4  5 
 
21 A FAST ASYMPTOTICALLY EFFICIENT ALGORITHM FOR BLIND SEPARATION OF A LINEAR MIXTURE OF BLOCK-WISE STATIONARY AUTOREGRESSIVE PROCESSES
 

Summary:  is the iteration index, the off-diagonal elements of ¨ SU WV obey the 6 6 linear systems Y (` SU aV% 2 (` SU aV2... a general number of intervals together to de- termine ¨ SU aV (because the mixing matrix is assumed... to be common to all intervals). The result is Y (` SU aV% 2 (` SU ...

  

Source: Yeredor, Arie - Department of Electrical Engineering-Systems, Tel Aviv University

 

Collection: Engineering

 
22 Artificial Intelligence, 56(2-3):223254, August 1992. On the Complexity of Blocks-World Planning
 

Summary:  , it is not the only one. For example, Winograd's original version of the blocks world [23] included complications... wish to thank James Hendler for his many helpful comments and discussions with us. References [1] A. V... Artificial Intelligence, 56(2-3):223­254, August 1992. On the Complexity of ...

  

Source: Nau, Dana S. - Institute for Advanced Computer Studies & Department of Computer Science, University of Maryland at College Park

 

Collection: Computer Technologies and Information Sciences

 
23 A Structure-Conveying Modelling Language for Mathematical and Stochastic Programming
 

Summary:  . Problem (6) needs to evaluate its system matrix A(e,l)/A(v,i) (corresponding to the dark grey blocks... to the diagonal blocks in Figure 1) that can be solved independently. The top level optimises these complicating... -th commodity through the edge-reduced network. Similarly let ...

  

Source: Grothey, Andreas - School of Mathematics, University of Edinburgh

 

Collection: Mathematics

 
24 Massachusetts Institute of Technology Design and Verification of Adaptive
 

Summary:  and implementation complexity. It is also one of the most complicated problems because e cient cache coherence... . Cache coherence protocols can be extremely complicated, especially in the presence of vari- ous... and non- blocking caches. Every programming language has a high-level memory model 19, 56, 54, 92

  

Source: Massachusetts Institute of Technology (MIT), Computer Science and Artificial Intelligence Laboratory, Computation Structures Group

 

Collection: Computer Technologies and Information Sciences

 
25 SIAM J. ALG. DISC. METH. Vol. 3, No. 1, March 1982
 

Summary:  . REFERENCES [1] A. V. AHO, J. E. HOPCROFT AND J. D. ULLMAN, The Design and Analysis of... the strip is stratified into blocks, each block running the full width of the strip and resting on the top... of the previous block (the first block rests on the bottom of the ...

  

Source: Graham, Fan Chung - Departments of Mathematics & Computer Science and Engineering, University of California at San Diego

 

Collection: Computer Technologies and Information Sciences

 
26 The impact of sample size and marker selection on the study of haplotype
 

Summary:  comparison is more complicated than block boundary comparison because the Tag SNPs are not unique for each... be divided into many blocks, within which there is limited haplotype diversity. In addition, only a few... genetic markers in a putative block are needed to capture most of the diversity within a ...

  

Source: Zhao, Hongyu - School of Public Health, Yale University

 

Collection: Biology and Medicine

 
27 PIERS Draft Abstracts, Moscow, Russia, August 1821, 2009 631 Microwave Imaging in Closed Cavities --Locating Spatial
 

Summary:  . 2003. 4. Brovko, A. V., E. K. Murphy, M. Rother, H. P. Schuchmann, and V. V. Yakovlev, "Waveguide... -destructive evaluation and testing (NDE/NDT) are typically quite complicated. In terms of measurements, MW imaging... for: (1) a glass sphere in a rectangular Teflon block, (2) an air sphere in a rectangular ...

  

Source: Yakovlev, Vadim - Department of Mathematical Sciences, Worcester Polytechnic Institute

 

Collection: Mathematics

 
28 Distributed algorithm for approximating the maximum matching
 

Summary:  will be independent of paths from PG. 2 References [FGHP93] T. Fischer, A. V. Goldberg, D. J. Haglin, S. Plotkin... matchings, SIAM J. Discrete Math. Vol.15, No.1, pp. 41-57. [AGLP89] B. Awerbuch, A.V. Goldberg, M. Luby... spanners in 2 #12;blocks and use these spanners to compute matchings. One difference ...

  

Source: Czygrinow, Andrzej - Department of Mathematics and Statistics, Arizona State University

 

Collection: Mathematics

 
29 Active Probing to Classify Internet Address Blocks USC/ISI Technical Report ISI-TR-653, August 2008
 

Summary:  ). These metrics define an (A, V ) plain of address blocks. We also consider the distribution of lengths of up dura... categories, as indicated in the plane. The right rectangle around (A, V ) = (0.95, 0.0016) are blocks... .4) are blocks of stable ...

  

Source: Heidemann, John - Information Sciences Institute, University of Southern California

 

Collection: Computer Technologies and Information Sciences

 
30 Phase behavior of symmetric linear multiblock P. E. Theodorakis and N. G. Fytas
 

Summary:  ] Erukhimovich I. Ya. and Dobrynin A. V., Macromole- cules, 25 (1992) 4411. [16] Angerman H., ten Brinke G... . and Erukhimovich I., Macromolecules, 29 (1996) 3255. [17] Dobrynin A. V. and Leibler L., Macromolecules, 30 (1997... the phase behavior of a single linear multiblock copolymer with ...

  

Source: Dellago, Christoph - Institute for Experimental Physics, Universität Wien

 

Collection: Physics ; Materials Science

 
31 Introduction Due to their ability to microphase separate into well ordered structures with
 

Summary:  , however, surface interactions very much complicate the phase behavior. The block that has the lower... with periodicities on the nanometer scale, block copolymers are ideal candidates as building blocks... for the fabrication of nanomaterials. Especially thin films of block copolymers ...

  

Source: Groningen, Rijksuniversiteit - Centre for Ecological and Evolutionary Studies, Department of Marine Benthic Ecology and Evolution,

 

Collection: Biology and Medicine ; Environmental Sciences and Ecology

 
32 Testing Operating Systems with RT-Tester
 

Summary:  requirement) On-target tests for embedded systems usually complicate white-box testing On-target tests require... , 4) f (l3, 6) 17 #12;Technologie-Zentrum Informatik Reachability Trees for MCDC Coverage (BLOCK_19... ,125) (BLOCK_18,126) aux1 == 1 (BLOCK_15,127) y > 1.0e+1 ...

  

Source: Peleska, Jan - Fachbereich 3 - Mathematik und Informatik, Universität Bremen

 

Collection: Computer Technologies and Information Sciences

 
33 Selective, Accurate, and Timely Self-Invalidation Using Last-Touch Prediction
 

Summary:  ) cached copies of a memory block, incurring high overheads. This paper proposes Last-Touch Predictors... (LTPs) that learn and predict the "last touch" to a memory block by one processor before the block... -)invalidating the block in advance, an LTP hides the invalidation time, significantly reducing the ...

  

Source: Falsafi, Babak - Department of Electrical and Computer Engineering, Carnegie Mellon University

 

Collection: Computer Technologies and Information Sciences ; Engineering

 
34 Multidimensional Blocking in UPC Christopher Barton1
 

Summary:  with blocking factor b. Given an array index v = v0, v1, ...vn-1, to locate element A[v] we first calculate... element A[v] resides. Within the local storage of this thread the array is kept as a collection of blocks... within the block. thread(A, ...

  

Source: Amaral, José Nelson - Department of Computing Science, University of Alberta

 

Collection: Computer Technologies and Information Sciences

 
35 Physics 105 Problem Set 2 Solutions Problem 1. (10 Points)
 

Summary:  where there is a block of mass M1 on top of a block of mass M2, when the coefficient of friction between... the blocks is µ. There is no friction between the bottom block and the table. We need to find the maximum... horizontal force so that the blocks can accelerate without slipping on ...

  

Source: Princeton University, Atomic Physics

 

Collection: Fission and Nuclear Technologies ; Physics

 
36 In Proceedings of 12th International Conferences on Database and Expert Systems Applications (DEXA 2001), Munich, Germany, September 37, 2001. 01. Vol. ?, pp. ??????.
 

Summary:  of the block. These scaling and rotation operations involve complicated computations based on fundamental... and rotating blocks, will be highly complicated. Also, the actual geometrical and mathematical steps involved... system. It is based on the idea of creation of blocks and their ...

  

Source: Liu, Mengchi - School of Computer Science, Carleton University

 

Collection: Computer Technologies and Information Sciences

 
37 QUEEN MARY, UNIVERSITY OF LONDON MAS 314 Design of Experiments
 

Summary:  This practical covers the analysis of designed experiments when the plots are grouped into blocks, the treatments... are unstructured and the design is an orthogonal block design. 1 (A complete-block design: analysis with blocks... . The experimenter knew that the ground was quite variable, so he divided it ...

  

Source: Bailey, R. A. - School of Mathematical Sciences, Queen Mary, University of London

 

Collection: Mathematics

 
38 Nonlinear Processes in Geophysics (2004) 11: 553560 SRef-ID: 1607-7946/npg/2004-11-553 Nonlinear Processes
 

Summary:  , Theory for Soils and Rocks, edited by: M¨uhlhaus, H. B., Dyskin, A. V., and Pasternak, E., Balkema... Processes in Geophysics © European Geosciences Union 2004 Earthquake statistics in a Block Slider Model... of the Block-Slider model of Carlson et al. (1991), a model often employed in seismic- ity ...

  

Source: Ecole Polytechnique, Centre de mathématiques

 

Collection: Mathematics

 
39 Introduction to Systems Software
 

Summary:  complicated allocate and free since needs to splice blocks in and out of the list Some extra space... Track of Free Blocks · Method 1: Implicit list using lengths -- links all blocks · Method 2: Explicit... list among the free blocks using pointers within the free ...

  

Source: Crowley, Patrick - Department of Computer Science and Engineering, Washington University in St. Louis

 

Collection: Computer Technologies and Information Sciences ; Engineering

 
40 Optimizing the Performance of Sparse Matrix-Vector Multiplication Bachelor of Science, Seoul National University, Seoul, 1991
 

Summary:  hierarchy optimizations, in particular, reorganization of the matrix and computation around blocks... of the matrix. The research demonstrates that certain kinds of blocking can be e#11;ective for both registers... typical register sets and caches. Both types of blocking are shown to be highly e#11;ective in some

  

Source: Im, Eun-Jin - School of Computer Science, Kookmin University; Yelick, Katherine - Department of Electrical Engineering and Computer Sciences, University of California at Berkeley

 

Collection: Computer Technologies and Information Sciences


Page:   1  2  3  4  5 
Page:   1  2  3  4  5 
 
41 Carnegie Mellon Introduction to Computer Systems
 

Summary:  complicated allocate and free since needs to splice blocks in and out of the list Some extra space... : Fragmentation Internal: External: payload Internal fragmentation block Internal fragmentation p4 = malloc(6... of Free Blocks Method 1: Implicit free list using length--links all ...

  

Source: Silber, Georges-André - Centre de recherche en informatique, Ecole des Mines de Paris

 

Collection: Computer Technologies and Information Sciences

 
42 4Block Heuristic for the Rectangle Packing Problem Guntram Scheithauer Uta Sommerwei \Lambda
 

Summary:  is optimal with respect to the set of patterns having 4­block structure. 6 #12; (a) v=992336 (b) v=990198, t... ; and the remaining pieces are in block IV.) 16 #12; (a) v = 867860, 4­block pattern (b) v = 957878, 8­block ...

  

Source: Scheithauer, Guntram. - Fachrichtung Mathematik, Technische Universität Dresden

 

Collection: Mathematics

 
43 Parallel Tridiagonalization through Two-Step Band Reduction Christian Bischof Bruno Lang
 

Summary:  . Dongarra, I. S. Du , D. C. Sorensen, and H. A. V. der Vorst, Solving Linear Systems on Vector and Shared... and then to tridiagonal form. The rst step allows easy exploitation of block orthog- onal transformations. In the second... step, we employ a new blocked version of a banded matrix tridiagonal- ...

  

Source: Argonne National Laboratory, Mathematics and Computer Science Division (MCS)

 

Collection: Mathematics ; Computer Technologies and Information Sciences

 
44 Symbolic Debugging of Globally Optimized Code: Data Value Problems and Their Solutions
 

Summary:  and object code become complicated, and values of variables may either be inaccessible in the run­time state... the control flow graph by duplicating basic blocks. These transformations, however, do not reorder... to a different basic block, the basic block is post­dominated by the original ...

  

Source: Shewchuk, Jonathan - Department of Electrical Engineering and Computer Sciences, University of California at Berkeley

 

Collection: Computer Technologies and Information Sciences

 
45 982 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 3, NO. 3, MAY 2004 Space-Time D-Block Codes via the Virtual
 

Summary:  , vol. 48, pp. 950­956, Apr. 2002. [19] A. V. Geramita and J. Seberry, Orthogonal Designs, Quadratic... 982 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 3, NO. 3, MAY 2004 Space-Time D-Block Codes... as a building block for general correlated channels. Space-time -block codes that ...

  

Source: Sayeed, Akbar M. - Department of Electrical and Computer Engineering, University of Wisconsin at Madison

 

Collection: Computer Technologies and Information Sciences

 
46 2 Basic Notions of Coding Theory Before discussing convolutional codes it is essential to recall the basic notions of
 

Summary:  #12;Put furthermore F Fn such that ~a, F = F. H(cwe(c + V )) = vc+V H(µv) = q-n 2 vc+V aFn a(v)µa = q... -n 2 vc+V aF bE v(a + b)µa+b = q-n 2 vc+V aF v(a) bE µa+b = q-n 2 aF bE µa+b vc+V a(v) = q-n 2 F a... F bE µ~a+a+b vc+V ~a+a(v). (2.3) If in the rightmost sum of the last row a = 0 one obtains: vc+V ...

  

Source: Groningen, Rijksuniversiteit - Centre for Ecological and Evolutionary Studies, Department of Marine Benthic Ecology and Evolution,

 

Collection: Biology and Medicine ; Environmental Sciences and Ecology

 
47 The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation
 

Summary:  memory; B = # of elements per disk block; D = # of parallel disks, where M < N and 1 DB M/2. Depending... /O operation (or I/O) in the model is the process of simultaneously reading or writing D blocks of data, one... block of B contiguous elements to or from each of the D disks. The I/O- complexity of an algorithm

  

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

 

Collection: Computer Technologies and Information Sciences

 
48 Manipulation and Compositing of MC-DCT Compressed Video1 (For publication in IEEE JSAC Special Issue on Intelligent Signal Processing, 1994)
 

Summary:  1985, pp. 41-44. 12.J.D. Foley, A. V. Dam, S. K. Feiner and J.F. Hughes, Computer Graphics: Principles... manipulation functions include translation (block-wise or pixel-wise), scaling, linear filtering, rotation... in Section 6. 2 Background and Domain Definitions Figure 2 shows the block diagram for hybrid ...

  

Source: Chang, Shih-Fu - Department of Electrical Engineering, Columbia University

 

Collection: Computer Technologies and Information Sciences

 
49 Minimizing incomplete automata Marie-Pierre Beal
 

Summary:  the fact that the splittings of blocks become more complicated, because a block can be split into more than... space O(n + m + k). 8 hal-00620274,version1-3Oct2011 #12;References [1] A. V. Aho, J. E. Hopcroft, and J... a direct access to edges labeled by a given letter and coming in a ...

  

Source: Paris-Sud XI, Université de - Institut d'Optique, Laboratoire Charles-Fabry, Groupe d'Optique Atomique

 

Collection: Physics

 
50 NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2010; 00:122
 

Summary:  , . . . , j, of Xj is of the form xk = pk-1(A)v, where pn(A) is a polynomial of degree n in A, it follows... quantities of the form uT f(A)v, (6) where u and v are N-vectors, A is an N × N symmetric matrix, and f... be rewritten as uT f(A)v = N j=1 f(j) uT qjqT j v, (7) which can also be viewed as a Riemann-Stieltjes integral

  

Source: Lambers, James - Department of Mathematics, University of Southern Mississippi

 

Collection: Computer Technologies and Information Sciences ; Mathematics

 
51 Software Based Instruction Caching for the RAW Architecture Jason Eric Miller
 

Summary:  of instructions. This makes arranging them in memory more complicated. If the blocks are placed at fixed locations... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2 Major Design Issues 15 2.1 Block Size... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.1.1 Basic ...

  

Source: Massachusetts Institute of Technology (MIT), Department of Electrical Engineering and Computer Science, RAW Project

 

Collection: Computer Technologies and Information Sciences

 
52 Software Based Instruction Caching for the RAW Architecture Jason Eric Miller
 

Summary:  of instructions. This makes arranging them in memory more complicated. If the blocks are placed at fixed locations... in a register) [3]. The problem with chaining is that it greatly complicates deallocation. When a block that has... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2 Major ...

  

Source: Massachusetts Institute of Technology (MIT), Department of Electrical Engineering and Computer Science, RAW Project

 

Collection: Computer Technologies and Information Sciences

 
53 Gambit: A Tool for the Simultaneous Placement and Detailed Routing of Gate-Arrays
 

Summary:  of the switch-blocks complicates the design problem, it also allows us to divide the channel wires... [1] Aho, A.V., Sethi, R., and Jeffery, U.D. Compilers: Principles, Techniques, and Tools. Addison... . In considering this diagram, we are concerned with five components. Logic blocks provide the ...

  

Source: Batson, Alan - Department of Computer Science, University of Virginia

 

Collection: Computer Technologies and Information Sciences

 
54 Effects of Casting Solvents on the Formation of Inverted Phase in Block Copolymer Thin Films
 

Summary:  forms the major domain.32 Moreover, in block copolymer solutions, the phase behavior is more complicated... .; Sevink, G. J. A.; Zvelindovsky, A. V.; Magerle, R. Phys. Rev. Lett. 2002, 89, 035501. (11) Konrad, M... . A.; Zvelindovsky, A. V.; Magerle, R. J. Chem. Phys. ...

  

Source: Wu, Chi - Department of Chemical Physics, University of Science and Technology of China

 

Collection: Chemistry ; Materials Science

 
55 CUDA Programming on NVIDIA GPUs Practical 8: scan operation and recurrence equations
 

Summary:  block, and then extends it to enable the parallel solution of a long recurrence equation. · Copy... an addition scan operation using a single thread block, reading in the input data from device memory... , it actually gets quite complicated working out what happens to the indices ai and bi for each thread. Maybe

  

Source: Giles, Mike - Mathematical Institute, University of Oxford

 

Collection: Engineering ; Computer Technologies and Information Sciences

 
56 Skip B-Trees Ittai Abraham1
 

Summary:  in blocks near each other enabling efficient range queries. Using this data structure, we describe a new... on deletion and insertion, and the addition and removal of nodes are based on a complicated self... , where b is the block size. When b = N1/k for some constant k, then for any set of N items, all

  

Source: Aspnes, James - Department of Computer Science, Yale University

 

Collection: Computer Technologies and Information Sciences

 
57 Cache Performance Analysis of Traversals and Random Accesses Richard E. Ladner \Lambda James D. Fix y Anthony LaMarca z
 

Summary:  and related problems. Communications of the ACM, 31(9):1116--1127, 1988. [5] A. V. Aho, P. J. Denning, and J... complicated and there is no way to analyze arbitrary access patterns. Accordingly, we model algorithms... sequentially and a per­ mutation traversal that visits every block in the contigu­ ous ...

  

Source: Fix, Jim - Department of Mathematics, Reed College

 

Collection: Mathematics

 
58 Building Patterned Structures with Robot Swarms Justin Werfel1,2
 

Summary:  robots. Blocks, less complicated mechanically, may be less sub- ject to failure. Malfunctions that do... prefabricated modules as build- ing blocks. Modules are capable of some infor- mation processing, enabling them... components (robots and modular blocks, re- spectively). Our approach is to use robots ...

  

Source: Nagpal, Radhika - School of Engineering and Applied Sciences, Harvard University

 

Collection: Engineering ; Computer Technologies and Information Sciences

 
59 FiniteState Encoders As described in Section 1.4, an encoder takes the form of a finitestatemachine (see Fig
 

Summary:  distinct input tags from an alphabet of size n. The notation u s=a ! v stands for an edge in E from state u... equals the number of pairs of edges u s=a ! v and u 0 s 0 =a 0 ! v 0 in E , with distinct input tags s 6... assume that the input tags are the binary p­blocks. A tagged (S; ...

  

Source: Roth, Ronny - Department of Computer Science, Technion, Israel Institute of Technology; Siegel, Paul H. - Department of Electrical and Computer Engineering, University of California at San Diego

 

Collection: Computer Technologies and Information Sciences ; Engineering

 
60 Finite-State Encoders As described in Section 1.4, an encoder takes the form of a nite-state-machine (see Fig-
 

Summary:  an alphabet of size n. The notation u s=a ! v stands for an edge in E from state u to state v which is labeled... , and for every u u0 v v0 2 VE, the entry (RE E )hu u0 i hv v0 i equals the number of pairs of edges u s=a ! v... that the input tags are the binary p-blocks. A tagged (S ...

  

Source: Siegel, Paul H. - Department of Electrical and Computer Engineering, University of California at San Diego

 

Collection: Engineering


Page:   1  2  3  4  5 
Page:   1  2  3  4  5 
 
61 ON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH
 

Summary:  that satisfies p(A)v1 = 0. Then the Arnoldi algorithm sequentially generates vectors v1, . . . , vd... , such that span {v1, . . . , vn} = span {v1, . . . , An-1 v1} Kn(A, v1), n = 1, . . . , d,(1.1) vi, vj B = 0, i... = 1, . . . , d. If d is the grade of v1 with respect to A, then Kd(A, ...

  

Source: Liesen, Jörg - Institut für Mathematik, Technische Universität Berlin

 

Collection: Mathematics

 
62 Density functional theory for a primitive model of nanoparticle-block copolymer mixtures
 

Summary:  . Balazs, Macromolecules 37, 3536 2004 . 14 G. J. A. Sevink, A. V. Zvelindovsky, B. A. C. van Vlimmeren, N... Density functional theory for a primitive model of nanoparticle-block copolymer mixtures Dapeng... Amphiphilic block copolymers provide useful templates for fabrication of nanostructured materials

  

Source: Wu, Jianzhong - Department of Chemical and Environmental Engineering, University of California at Riverside

 

Collection: Materials Science ; Engineering

 
63 Natural Hazards and Earth System Sciences (2001) 1: 7581 c European Geophysical Society 2001 Natural Hazards
 

Summary:  in taxonomic prob- lems, Ann. Eugenics, 7, 179­188, 1936. Gershenzon, N. I., Gohberg, M. B., Karakin, A. V... in this situation is complicated by a great variabil- ity of earthquakes and accompanied phenomena, which ag... among blocks, which consist of wavelet packet coefficients. 1 Introduction It is ...

  

Source: Ecole Polytechnique, Centre de mathématiques

 

Collection: Mathematics

 
64 CUDA Programming on NVIDIA GPUs Practical 3: Laplace solver
 

Summary:  NX, NY, NZ are parameters set in the host code. · The grid is cut into pieces of size BLOCKBLOCK Y... in the x - y direction, and each thread block uses BLOCK X*BLOCK Y threads, with each thread processing one... point in each 2D plane. The parameters BLOCK X, ...

  

Source: Giles, Mike - Mathematical Institute, University of Oxford

 

Collection: Engineering ; Computer Technologies and Information Sciences

 
65 EEC 483 Computer Organization 5.2 The Basics of Cache
 

Summary:  ) no (miss) read data from cache bring data & more (block) from memory into cache Spatial locality Temporal... : How do we know if a data item is in the cache? If it is, how do we find it? Our first example: Block... size is 16 bytes of data (0x10 bytes) Memory has 256 bytes (0x100 bytes, 0x10 blocks) Cache has 128

  

Source: Yu, Chansu - Department of Electrical and Computer Engineering, Cleveland State University

 

Collection: Computer Technologies and Information Sciences

 
66 Dissipation of excitation fronts as a mechanism of conduction block in reentrant waves
 

Summary:  ] V. I. Krinsky. Fibrillation in excitable media. Cybernetics problems, 20:59--80, 1968. [2] A. V... . Panfilov and A. V. Holden. Self­generation of turbulent vortices in a 2­ dimensional model of cardiac... in mathematical­models of excitable media. Physica A, 188:55--60, 1992. [4] V. N. Biktashev and ...

  

Source: Biktashev, Vadim N. - Department of Mathematical Sciences, University of Liverpool

 

Collection: Mathematics

 
67 Dissipation of excitation fronts as a mechanism of conduction block in re-entrant waves
 

Summary:  :59­80, 1968. [2] A. V. Panfilov and A. V. Holden. Self-generation of turbulent vortices in a 2- dimensional... and A. V. Holden. Re-entrant waves and their elimination in a model of mammalian ventricular tissue... . Chaos, 8:48­56, 1998. [5] I. V. Biktasheva, V. N. ...

  

Source: Biktashev, Vadim N. - Department of Mathematical Sciences, University of Liverpool

 

Collection: Mathematics

 
68 ON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH
 

Summary:  that satisfies p(A)v1 = 0. Then the Arnoldi algorithm sequentially generates vectors v1, . . . , vd... , such that span {v1, . . . , vn} = span {v1, . . . , An-1 v1} Kn(A, v1), n = 1, . . . , d,(1.1) vi, vj B = 0, i... = 1, . . . , d. If d is the grade of v1 with respect to A, then Kd(A, ...

  

Source: Liesen, Jörg - Institut für Mathematik, Technische Universität Berlin

 

Collection: Mathematics

 
69 When Cache Blocking Sparse Matrix Vector Multiply Works and Rajesh Nishtala Richard Vuduc James W. Demmel Katherine A. Yelick
 

Summary:  When Cache Blocking Sparse Matrix Vector Multiply Works and Why Rajesh Nishtala Richard Vuduc James... indicates that cache blocking of SpM×V is extremely important for some matrix and machine combinations... , with speedups as high as 3x. In this paper we present a new, more compact data structure for cache blocking

  

Source: Zakhor, Avideh - Department of Electrical Engineering and Computer Sciences, University of California at Berkeley

 

Collection: Engineering ; Computer Technologies and Information Sciences

 
70 MATLAB SIMULINK -Simulation and Model Based Design
 

Summary:  clutter in a complicated block diagram. 2. Send multiple signals to the same scope; then both signals... window that pops up is the Library Browser. This is a library of blocks that are available for putting... into the Simulink block diagram. #12;Simulink Help Select "Simulink Help" from the help menu in ...

  

Source: White, Robert D. - Department of Mechanical Engineering, Tufts University

 

Collection: Engineering

 
71 Compilation as Metacomputation: Binding Time Separation in Modular Compilers
 

Summary:  to significant improvements in the presentation. References [1] A. V. Aho, R. Sethi, and J. D. Ullman Compilers... : expressions, control­flow, imperative features, block structure, and higher­order functions and recursive bind... compilation. Modular compilers are compilers built from building blocks that ...

  

Source: Kamin, Sam - Department of Computer Science, University of Illinois at Urbana-Champaign

 

Collection: Computer Technologies and Information Sciences

 
72 Compilation as Metacomputation: Binding Time Separation in Modular Compilers
 

Summary:  in the presentation. References 1] A. V. Aho, R. Sethi, and J. D. Ullman Compilers: Principles, Techniques, and Tools... : expressions, control- ow, imperative features, block structure, and higher-order functions and recursive bind... compilation. Modular compilers are compilers built from building blocks ...

  

Source: Kamin, Sam - Department of Computer Science, University of Illinois at Urbana-Champaign

 

Collection: Computer Technologies and Information Sciences

 
73 Graph Drawing for Floorplanning Page 1 of 13 Graph Drawing for Floorplanning with Flexible Blocks
 

Summary:  performance) by placing connected blocks in close proximity. Often complicating floorplanning are flexible... Graph Drawing for Floorplanning Page 1 of 13 Graph Drawing for Floorplanning with Flexible Blocks... for reducing wire length while placing flexible blocks during the floorplanning stage of computer ...

  

Source: Ellis-Monaghan, Joanna - Department of Mathematics, Saint Michaels College

 

Collection: Mathematics

 
74 Edwards and Tardieu Efficient Code Generation from SHIM Models
 

Summary:  value__V0 = 17 12 A__V0 = value__V0 13 source_state = 2 14 goto 30 15 source_state = 8 16 goto 42 17... value__V3 = 8 18 A__V0 = value__V3 19 source_state = 8 20 goto 30 21 value__V2 = 157 22 A__V0 = value... __V2 23 source_state = 6 24 goto 30 25 value__V1 = 42 26 A__V0 = value__V1 27 source_state = 4 28 ...

  

Source: Columbia University, Department of Computer Science, Languages and Compilers Research Group; Tardieu, Olivier - INRIA Sophia Antipolis

 

Collection: Computer Technologies and Information Sciences

 
75 Preprint typeset in JHEP style -HYPER VERSION The large central charge limit of conformal blocks
 

Summary:  first review the case of Virasoro conformal blocks, before moving to the technically more complicated... Preprint typeset in JHEP style - HYPER VERSION The large central charge limit of conformal blocks... .fr ABSTRACT: We study conformal blocks of conformal field theories with a W3 symmetry algebra

  

Source: Paris-Sud XI, Université de - Institut d'Optique, Laboratoire Charles-Fabry, Groupe d'Optique Atomique

 

Collection: Physics

 
76 This work is supported in part by Wright Laboratory Avionics Directorate, Air Force Material Command, USAF, under grant #F33615-94-1-1525 and
 

Summary:  DsDuPwqh EDTXw y sDr SDCheDgfgeDiDB q sDt Sue xvePGXB&v&wDw Cfw$w pFp |RFr d& TePTqDB ~ (a) vT$TBPw$w EDT dhe... cost-effective as build- ing blocks. By connecting these low-cost nodes, system designers hope... overhead). This is fur- ther complicated by the large--i.e., page--granularity. ...

  

Source: Wood, David A. - Department of Computer Sciences, University of Wisconsin at Madison

 

Collection: Computer Technologies and Information Sciences

 
77 Interprocedural Control Flow Analysis of FirstOrder Programs with Tail Call Optimization \Lambda
 

Summary:  across procedure boundaries. References [1] A. V. Aho, R. Sethi and J. D. Ullman, Compilers -- Principles... complicates the analysis because returns may transfer control to a procedure other than the active procedure... the function reverse in line 7 corresponds to some basic block, and in order to ...

  

Source: Debray, Saumya - Department of Computer Science, University of Arizona

 

Collection: Computer Technologies and Information Sciences

 
78 Interprocedural Control Flow Analysis of First-Order Programs with Tail Call Optimization
 

Summary:  across procedure boundaries. References 1] A. V. Aho, R. Sethi and J. D. Ullman, Compilers { Principles... control to the point imme- diately after the call. Tail call optimization complicates the analysis because... basic block, and in order to construct the ow graph we need to determine the successors of ...

  

Source: Debray, Saumya - Department of Computer Science, University of Arizona

 

Collection: Computer Technologies and Information Sciences

 
79 RATE-CONSTRAINED MOTION ESTIMATION AND PERCEPTUAL CODING Yan Yang, Sheila S. Hemami
 

Summary:  block motion estimation scheme jointly op- timize both motion vector coder and residual coder... quantization and direct block coding. Since the encoder encodes the residual directly without any transform... , it achieves competitive speed with that of MPEG-1 even with the slightly more complicated motion estimation

  

Source: Hemami, Sheila S. - School of Electrical and Computer Engineering, Cornell University

 

Collection: Computer Technologies and Information Sciences

 
80 GENERALIZED BLOCK CONTROL H. Brandtstadter
 

Summary:  be much more complicated. In consequence this article investigates a generalized block con- trol principle... Principle for Mechanical Systems. JDSMC 122(1), 1­10. Utkin, V.A., V.I. Drakunov and D.B. Izosimov (1984... GENERALIZED BLOCK CONTROL PRINCIPLE S. Rao H. Brandtst¨adter V. ...

  

Source: Kuehnlenz, Kolja - Institute of Automatic Control Engineering, Technische Universität München

 

Collection: Engineering


Page:   1  2  3  4  5 
Page:   1  2  3  4  5 
 
81 Machine Learning, 43, 752, 2001 c 2001 Kluwer Academic Publishers. Manufactured in The Netherlands.
 

Summary:  state, i.e., (s) = arg max a (r(s, a) + V ((s, a))) With this formulation of we can acquire... ) = r(s, a) + V ((s, a)) Knowing Q , the Q-function for the optimal policy, allows us to rewrite... in the blocks world, where it is assumed that the effects of the actions are unknown to ...

  

Source: Dzeroski, Saso - Department of Knowledge Technologies, Jozef Stefan Institute

 

Collection: Computer Technologies and Information Sciences

 
82 DRAFT as of February 19, 2011: Copyright 2009 Cox, Kaashoek, Morris File system data structures
 

Summary:  of blocks. This is more complicated than reusing the file implementation but guarantees logarithmic... structures The disk driver and buffer cache (Chapter 6) provide safe, synchronized access to disk blocks... . Individual blocks are still a very low-level interface, too raw for most pro- grams. Xv6, ...

  

Source: Massachusetts Institute of Technology (MIT), Computer Science and Artificial Intelligence Laboratory, Parallel and Distributed Operating Systems Group

 

Collection: Computer Technologies and Information Sciences

 
83 Algebraic properties of compatible Poisson structures Pumei Zhang
 

Summary:  manifolds, Progress in Math- ematics, vol. 118, Basel and Boston, 1994, pp.255-260. [4] A.V.Bolsinov and A... .J.Insel and L.E.Spence, Linear Algebra, 4th Edition, Pearson Education, 2003, vol.1E pp.482-494. [10] A.V... Poisson brackets is one of the main goals of our research project. This problem is rather complicated

  

Source: Loughborough University, Department of Mathematical Sciences

 

Collection: Mathematics

 
84 Annals of Mathematics, 162 (2005), 439485 On the hardness of approximating
 

Summary:  , called the nonintersection graph. This graph is a key building-block in our construction. The formal... of the Long-code. Other rather large independent sets exist in G[n], which complicate the picture a little... of the independent sets discussed above. The value of p is constrained by additional technical complications ...

  

Source: Dinur, Irit - Department of Computer Science and Applied Mathematics, Weizmann Institute of Science

 

Collection: Computer Technologies and Information Sciences

 
85 Motion Vector Automatically Detecting Camera Motion from MPEG-1 Encoded Video
 

Summary:  reconstituting camera motion from compressed video as a possible aid for retrieval. The process is complicated... because of the presence of object motion in video, as well as complicated camera motion (panning... frames) ···· ···· An I-Frame is a JPEG compressed image. A B-Frame is divided into 22 x 18 = 396 blocks

  

Source: Lee, Hyowon - School of Computing, Dublin City University

 

Collection: Computer Technologies and Information Sciences

 
86 A Priority Ceiling Protocol with Dynamic Adjustment of Serialization Order * Kwokwa Lam 1 , Sang H. Son 2 and Sheunglun Hung 1
 

Summary:  the blocking time of transactions at the expense of abortion and re­execution overheads, they complicate... in priority­driven scheduling. The blocking delay due to priority inversion can be unbounded, which... to tackle these two problems. However, they are too conservative in scheduling transactions for the ...

  

Source: Son, Sang H. - Department of Computer Science, University of Virginia

 

Collection: Computer Technologies and Information Sciences

 
87 ffl length of file ffl number of blocks used
 

Summary:  ffl length of file ffl number of blocks used ffl creation, modification, and access times ffl depth... of index block tree ffl block number of file index block or only block in file ffl reserved space... for future expansion Each file consists of a BLOCK SIZE/4­way ...

  

Source: California Institute of Technology, Computer Science Department, Multi-Res Modeling Group; Winfree, Erik - Computer Science Department, California Institute of Technology

 

Collection: Biology and Medicine ; Computer Technologies and Information Sciences

 
88 Recording Shared Memory Dependencies Using Strata Satish Narayanasamy Cristiano Pereira Brad Calder
 

Summary:  and R3, involved in the RAW dependency are accessing a #12;R3 (B, V2) W3 (B, V2) W2 (A, V2) T1 T2 T3T1 T... 2 T3 W1 (A, V1) R1 (A, V1) W1 (A, V1) R1 (A, V1) R5 (A, ...

  

Source: Calder, Bradley - Department of Computer Science and Engineering, University of California at San Diego; Sair, Suleyman - Department of Electrical and Computer Engineering, North Carolina State University; Zhang, Xiangyu - Department of Computer Sciences, Purdue University

 

Collection: Computer Technologies and Information Sciences ; Engineering

 
89 NUMERICAL SIMULATION OF MONUMENTS BY THE CONTACT DYNAMICS METHOD
 

Summary:  . Curnier, editor, Proc. of Contact Mech. Int. Symp., pages 31{48, 1992. 8] Pegon P., Pinto A.V... constraints and large friction. The method is applied to monu- ments made of blocks. The relevance... INTRODUCTION When buildings made of stone blocks jointed or not with mortar are submitted to dyna- mical

  

Source: Ecole Polytechnique, Centre de mathématiques

 

Collection: Mathematics

 
90 Graphics Hardware (2003) M. Doggett, W. Heidrich, W. Mark, A. Schilling (Editors)
 

Summary:  Partitions", ACM Multimedia 2000 Nov. 2000. 12. A.V. Pereberin. "Hierarchical Approach for Tex- ture... modulation signal. Continuity of the low frequency signals helps to avoid block artefacts. Decompression... . Further cost complications arise due to texture filtering. If we just consider the case of texture

  

Source: Lunds Universitet, Department of Computer Science, Computer Graphics Group

 

Collection: Computer Technologies and Information Sciences

 
91 Optimized Description Logic Reasoning via Core Birte Glimm, Ian Horrocks, and Boris Motik
 

Summary:  Optimized Description Logic Reasoning via Core Blocking Birte Glimm, Ian Horrocks, and Boris Motik... of the model abstractions that they construct. To address this problem, we propose a new blocking tech- nique... that tries to identify and halt redundant construction at a much earlier stage than standard blocking

  

Source: Pfeifer, Holger - Institut für Künstliche Intelligenz, Universität Ulm

 

Collection: Computer Technologies and Information Sciences

 
92 This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 1
 

Summary:  IN MPSAS 11 Fig. 12. Die-cost sensitivity to maskset cost. (a) V = 100k, V = 2M. (b) V = 20 k, V = 500k... ://ieeexplore.ieee.org. Digital Object Identifier 10.1109/TVLSI.2010.2076841 various design stages. This significantly complicates... circuits with embedded macro blocks (e.g., memories, register files ...

  

Source: Lemieux, Guy - Department of Electrical and Computer Engineering, University of British Columbia

 

Collection: Engineering

 
93 CONVERGENCE OF RESTARTED KRYLOV SUBSPACES TO INVARIANT SUBSPACES
 

Summary:  Cn , K (A, v1) = span{v1, Av1, . . . , A -1 v1}. Such algorithms, including the Arnoldi... (A, v1) and select- ing approximate eigenvectors from this Krylov subspace. Though these approximate... . We explore how quickly (U, K (A, v1)) can be driven to zero as is ...

  

Source: Embree, Mark - Department of Computational and Applied Mathematics, Rice University

 

Collection: Mathematics

 
94 Compiling for EDGE Architectures Aaron Smith Jim Burrill1 Jon Gibson Bertrand Maher Nick Nethercote
 

Summary:  to compare incoming operands. However, too few restrictions on blocks would require more complicated hardware... into a sequence of structured blocks that the hardware executes atomically. The instructions within each block... imposes several restrictions on its blocks to simplify the ...

  

Source: McKinley, Kathryn S. - Department of Computer Sciences, University of Texas at Austin

 

Collection: Computer Technologies and Information Sciences

 
95 Computer Science Department Leslie Lamport
 

Summary:  notation that [A]v equals A (v = v), for any action A and state function v, for any action A and state... has an assigned block on each disk. The algorithm 2 #12;has two phases. In each phase, a processor... writes to its own block and reads each other processor's block on a majority of the disks.1 Only the ...

  

Source: Lamport ,Leslie - Microsoft Research

 

Collection: Computer Technologies and Information Sciences

 
96 Keeping Track of Free BlocksKeeping Track of Free Blocks Method 1Method 1: Implicit list using lengths: Implicit list using lengths ----links all blockslinks all blocks
 

Summary:  of total blocks -- much faster allocates when most of the memory is full Slightly more complicated allocate... Page ­ 1 ­ Keeping Track of Free BlocksKeeping Track of Free Blocks Method 1Method 1: Implicit list... using lengths: Implicit list using lengths ---- links all blockslinks all ...

  

Source: Chamberlain, Roger - Department of Computer Science and Engineering, Washington University in St. Louis

 

Collection: Computer Technologies and Information Sciences ; Engineering

 
97 Atmospheric Blocking and Mean Biases in Climate Models ADAM A. SCAIFE
 

Summary:  interval, implying 1 n å n i51 ui sinfi . 200 (f2 À f1 ) g 2aV . (A4) Blocking is identified when (A3... relationship and integrating between latitudes f1 and f2: DZ 5À 2aV g ðf2 f1 u sinf df, (A1) where all... quantities have their usual meaning. For model gridpoint data this becomes DZ 5À 2aV g (f2 ...

  

Source: Woollings, Tim - Department of Meteorology, University of Reading

 

Collection: Environmental Sciences and Ecology ; Geosciences

 
98 Matching for RunLength Encoded Strings Alberto Apostolico \Lambda Gad M. Landau y Steven Skiena z
 

Summary:  general versions of string matching, in particular edit distance computations? References [1] A.V. Aho, D... matrix M of blocks, such that M [i; j] contains the value of an optimal solution between prefixes X (i... with the uncompressed strings. B A A B A B C A Figure 1: Light and dark blocks defined by strings X and Y . Figure ...

  

Source: Skiena, Steven - Department of Computer Science, SUNY at Stony Brook

 

Collection: Computer Technologies and Information Sciences

 
99 A faster algorithm for matching planar maps under the weak Frechet Daniel Chen Leonidas J. Guibas Qixing Huang Jian Sun
 

Summary:  ,j}i,v1,jC . To see that |AU| 2|U|/3, let us suppose that |AU| > 2|U|/3. Then, c(A) = v1,jA c(v1,j) = v1... York, NY, USA, 1983. ACM. [6] A. V. Goldberg, H. Kaplan, and R. F. Werneck3. Reach for A : Efficient... , and a complicated charging scheme shows that the entire algorithm runs ...

  

Source: Sun, Jian - Department of Mathematical Sciences, Tsinghua University

 

Collection: Computer Technologies and Information Sciences

 
100 Automatic Data Structure Repair for Self-Healing Systems Brian Demsky
 

Summary:  and deallocation of inodes and disk blocks. #12;2.1 Data Layout Declarations The declarations in Figure 1 specify... arrays. The Disk struct declaration specifies that the disk consists of an array of Block objects... , with the superblock stored in the first disk block and the groupblock stored in the second disk ...

  

Source: Rinard, Martin - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

 

Collection: Computer Technologies and Information Sciences


Page:   1  2  3  4  5