نتایج جستجو برای: large scale integration

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

2000
Andreas C. Döring Gunther Lustig

In this paper the propagation of information about fault states and its implementation in high-speed networks is discussed. The algebraic concept of a lattice (partial ordered set with supremum and in mum) is used to describe the necessary operation. It turns out that popular algorithms can be handled this way. Using the properties of lattices e cient implementation options can be found.

Journal: :Inf. Sci. 1996
Guiseppe V. Russo Catia Petta Domenico Lo Presti Nunzio Randazzo Marco Russo

A Silicon Drift Detector Front-End and a Smart Readout System different from a trivial zerosuppression is proposed. ON-LINE pre-processing, using a Fast VLSI dedicated Fuzzy Processor, reduces significantly acquisition data volume and hardware requirements. Silicon Drift Detectors Readout and ON-LINE Data Reduction using a Fast VLSI Dedicated Fuzzy Processor 2

Journal: :SIAM J. Comput. 2002
Guy Even Sudipto Guha Baruch Schieber

Journal: :Journal of Electrical & Electronic Systems 2017

Journal: :The Journal of the Institute of Television Engineers of Japan 1969

2006
Haoxing Ren David Z. Pan Jacob Abraham Charles J. Alpert Adnan Aziz Nur Touba

vii

Journal: :Science 2002
Todd Thorsen Sebastian J Maerkl Stephen R Quake

We developed high-density microfluidic chips that contain plumbing networks with thousands of micromechanical valves and hundreds of individually addressable chambers. These fluidic devices are analogous to electronic integrated circuits fabricated using large-scale integration. A key component of these networks is the fluidic multiplexor, which is a combinatorial array of binary valve patterns...

Journal: :Information and Control 1984
Ralf Hartmut Güting

A set of polygons is called c-oriented if the edges of all polygons are oriented in a constant number of previously defined directions. The intersection searching problem is studied for such objects, namely: Given a set of c-oriented polygons P and a c-oriented query polygon q, find all polygons in P that intersect q. It is shown that this problem can be solved in O(logZn + t) time with O(n log...

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

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