نتایج جستجو برای: data bases quary optimization
تعداد نتایج: 2714340 فیلتر نتایج به سال:
Visual inspection of neuroimagery is susceptible to human eye limitations. Computerized methods have been shown to be equally or more e↵ective than human clinicians in diagnosing dementia from neuroimages. Nevertheless, much of the work involves the use of domain expertise to extract hand–crafted features. The key technique in this paper is the use of cross–domain features to represent MRI data...
We have systems rich in information but poor in knowledge. The paper shall sketch a framework in which information and knowledge could be properly integrated. Our initial hypothesis is that passing from information to knowledge involves the elaboration of a well structured theory of semiotic units. The latter is codified by a three-fold structure: an expression, a content and an ontological com...
1. Why Not Data Base Query? The undisputed favorite application for natural language interfaces has been data base query. Why? The reasons range from the relative simplicity of the task, including shallow semantic processing, to the potential real-world utility of the resultant system. Because of such reasons, the data base query task was an excellent paradigmatic problem for computational ling...
The research reported in this paper presents a solution to an open problem which arises in systems that use recursive production rules to represent knowledge. The problem can be stated as follows: "Given a recursive definition, how can we derive an equivalent non-recursive program with well-defined termination conditions". Our solution uses connection graphs to first detect occurrences of recur...
Digital databases can be represented by matrices, where rows (say) correspond to numerical sensors readings, or features, and columns correspond to data points. Recent data analysis methods describe the local geometry of the data points using a weighted affinity graph, whose vertices correspond to data points. We consider two geometries, or graphs one on the rows and one on the columns, such th...
Nowadays it is quite common to see companies with functional departments that, apart from having a central data base common to all the company, have information coming from multiple in-house applications that, in the majority of cases, is not centralised nor shared with other divisions in company. This dispersion of data creates redundancies in information, makes it difficult to get a single re...
The design and prototype implementation of a deduct ive processor f o r e f f i c i e n t ex t rac t ion of i m p l i c i t in format ion from e x p l i c i t data stored w i t h i n a r e l a t i o n a l data-base system is descr ibed. General statements (premises or inference ru les ) as wel l as queries are expressed in a canonical form as imp l i ca t i ons . From user quer ies , the system...
&bstract. The notions of a situation and a distance between situations in a narrow subject domain are introduced. ~ approach to the construction of an intellectual data base is suggested. The main task.of this data base is to find situations ~lhich are near to the one fixed by user. The theory of finite groups is considered as an example° I INTRODUCTION No~ information retrieval systems and esp...
The l o g i c a l p a r t d e t e r m i n e s the s t r u c t u r e o f t h e i t e m s i n the i n f o r m a t i o n p a r t , p r e f e r e n c e s be tween them and t h e i r c o n t r i b u t i o n to t he f i n a l r e s u l t . The i n f o r m a t i o n p a r t i s v a r i a b l e . By d e s i g n i n g the l o g i c a l p a r t s u f f i c i e n t l y g e n e r a l , one can use i t even...
Given a dictionary D = {d(k)} of vectors d(k), we seek to represent a signal S as a linear combination S = summation operator(k) gamma(k)d(k), with scalar coefficients gamma(k). In particular, we aim for the sparsest representation possible. In general, this requires a combinatorial optimization process. Previous work considered the special case where D is an overcomplete system consisting of e...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید