نتایج جستجو برای: only

تعداد نتایج: 1357814  

Journal: :Nature 1988

1998
A. Amara A. Turier L. Ben Ammar

Large memories require too much computing resources to be fully extracted and simulated. In this paper we present an accurate power and timing modeling technique that significantly reduces characterization resources. The model is based on current controlled generators, and can be used in several regular structures. Lowpower memories are more easily characterized using this technique, since they...

1991
Carl Ebeling Gaetano Borriello Scott A. Hauck David Song Elizabeth A. Walkup

Existing FPGA architectures can be classified along two dimensions: reprogrammable vs. one-time programmable and general-purpose vs. domain specific. The most challenging class of FPGA architectures to design is the reprogrammable, general-purpose FPGA, of which Xilinx is the most wellknown example. In this paper we describe Triptych, a new FPGA architecture that addresses two problems of curre...

2012
Pedro Miguens Matutino Hector Pettenghi Ricardo Chaves

In this paper a new ROM-less structure for binaryto-RNS conversion modulo {2 ± k} is proposed. The proposed structure is based on adders and constant multipliers units without the need for ROMs. The development of this generic structure is motivated by the inefficient performance and area occupation of structures that are generated for larger Dynamic Ranges, from the existing ROM based conversi...

2004
Giuseppe Castagna Rocco De Nicola Daniele Varacca

Subtyping relations for the π-calculus are usually de-fined in a syntactic way, by means of structural rules. Wepropose a semantic characterisation of channel types anduse it to derive a subtyping relation.The type system we consider includes read-only andwrite-only channel types, as well as boolean combinationsof types. A set-theoretic interpretation of types is pro...

2017
Eunjin Oh Hee-Kap Ahn

We are given a read-only memory for input and a write-only stream for output. For a positive integer parameter s, an s-workspace algorithm is an algorithm using only O(s) words of workspace in addition to the memory for input. In this paper, we present an O(n/s)-time s-workspace algorithm for subdividing a simple polygon into O(min{n/s, s}) subpolygons of complexity O(max{n/s, s}). As applicati...

Journal: :Seibutsu Butsuri 2002

Journal: :Nature 1986

Journal: :Current Biology 1998

Journal: :The Lancet 1919

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید