نتایج جستجو برای: very large database
تعداد نتایج: 1772850 فیلتر نتایج به سال:
It is highly desirable that users of systems which include NLP-based components, ranging from grmnmar-checkers to MT systems, can access the underlying Linguistic Knowledge Base in a natural and gratifying way. Our research aims at developing such Linguistic Discovery Assistants by merging hyperdocumcnts, Data Base Management Systems and interpretive adaptive interfaces. We have followed a step...
Discrete wavelet transform (DWT) is an efficient tool for multi-resolution decomposition of images. It has been shown to be very promising due to its high compression ratio and self-similar data structure. Conventionally a 2-D DWT is accomplished by performing two 1-D operations: one along the rows and the other along the columns of an image. Without executing ordered 1-D transforms, we develop...
Sorting is a fundamental operation that has important implications in a vast number of areas. For instance, sorting is heavily utilized in applications such as database machines, where hashing techniques are used to accelerate data processing algorithms. It is also the basis for interprocessor message routing and has strong implications in video telecommunications. However, high-speed electroni...
the problem of eye detection in face images is very important for a large number of applications ranging from face recognition to gaze tracking. in this paper we propose a new algorithm for eyes detection. first, the face region is extracted from the image by skin-color information. second, horizontal projection in image is used to approximate region of the eye be obtained . at last, the eye ce...
The molecule-atom data model (MAD model) supports the management of complex objects in databases. It allows for the dynamic definition of complex object structures at query time. Since these structures may be recursive, transitive closure computations are supported in a natural way. The results of these computations do not only contain the elements belonging to a closure: structured representat...
This paper provides an eficient method t o find all feasible offsets f o r a given separation in a VLSI channel routing problem in one layer. The prior literature considers this task only f o r problenis with no single-sided nets. When single-sided nets are included, the worst-case solution time increases from Q(n) to C2(ii2), where 11 is the number of nets. But we show that if the number of co...
The trend of VLSI CAD tool development evolves towards functionally specialized, methodology-dependent and technologydependent. Confusion can easily arise during the design process because of the proliferation of CAD tools and the mammoth amounts of design data. This is aggravated by the fact that different CAD tools are usually created by different vendors with different interface styles. As a...
In many path nding problems arising in diverse areas, such as transportation science [8], web search [4], database queries [1], [28], [42] and VLSI design certain patterns of edge/vertex labels in the labeled graph being traversed are allowed/preferred, while others are disallowed. Thus, the feasibility of a path is determined by (i) its length (or cost) under well known measures on graphs such...
Recommender systems learn about user preferences over time, automatically finding things of similar interest. This reduces the burden of creating explicit queries. Recommender systems do, however, suffer from cold-start problems where no initial information is available early on upon which to base recommendations. Semantic knowledge structures, such as ontologies, can provide valuable domain kn...
This paper discusses the aspects of modern MOS modeling requirements. Starting from the fact, that even the Compact Model Council (CMC) outlined BSIM3v3 as a standard MOS simulation model, many other models are used throughout the semiconductor community. Their common approach is they are all highly scalable to cover a wide range of transistor dimensions. To cover this effect, a strategy for ef...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید