نتایج جستجو برای: efficient
تعداد نتایج: 434318 فیلتر نتایج به سال:
OFFIS and Politecnico di Milano. This document may be copied freely for use in the public domain. Sections of it may be copied provided that acknowledgement is given of this original work. No responsibility is assumed by the REQUEST Project or its members for application or design, nor for any infringements of patents or rights of others which may result from the use of this document. Preface—T...
In contrast to XML query languages as e.g. XPath which require knowledge on the query language as well as on the document structure, keyword search is open to anybody. As the size of XML sources grows rapidly, the need for efficient search indices on XML data that support keyword search increases. In this paper, we present an approach of XML keyword search which is based on the DAG of the XML d...
Theories and tools to measure the efficiency of neural codes have been important in understanding neural responses to external stimuli. However, similar principles to describe the efficiency of brain responses to tasks demanding higher-order cognitive processes remain underdeveloped. A key domain to study such efficiency is learning, where patterns of activity across the entire brain provide in...
From the viewpoint of multilingual generation, the common underlying knowledge base should be kept clear of language-speciic concepts. This goal presupposes that lexical items of various languages cannot map one-to-one onto concepts all the time. We propose a more exi-ble way of attaching lexical items to conngurations of concepts and roles, and a lexical option nder that determines the set of ...
This paper critically examines Jerry Fodor’s latest attacks on evolutionary psychology. Contra Leda Cosmides and John Tooby, Fodor argues (i) there is no reason to think that human cognition is a Darwinian adaptation in the first place, and (ii) there is no valid inference from adaptationism about the mind to massive modularity. However, Fodor maintains (iii) that there is a valid inference in ...
We have developed a planner for redundant manipula-tors that is fast, eeective and versatile, based on the idea of treating each link of a rigid-linked robot as if it were slightly exible and under the innuence of a potential eld. We describe the extensions to the basic method that allow it to plan paths for manipulators with revolute joints (linear and spherical joints having been covered in a...
Purpose of this paper This paper aims to provide an efficient algorithm for XML twig query evaluation. Design/Methodology/Approach In this chapter, we propose a single-phase holistic twig pattern matching method based on the TwigStack algorithm. Our method applies a novel stack structure to preserve the holisticity of the twig matches. Twig matches rooted at elements that are currently in the r...
The multiple minimum degree (MMD) algorithm and its variants have enjoyed 20+ years of research and progress in generating ll-reducing orderings for sparse, symmetric positive deenite matrices. Although conceptually simple, eecient implementations of these algorithms are deceptively complex and highly specialized. In this case study, we present an object-oriented library that implements several...
We discuss the existential fragments of two theories of concatenation. These theories describe concatenation of possibly nested lists in the algebra of nite trees with lists and in the algebra of rational trees with lists. Syntax and the choice of models are motivated by the treatment of lists in PROLOG III. In a recent prototype of this language, Colmerauer has integrated a built-in concatenat...
Using well-defined selection criteria applied to the LEDA galaxy catalogue we have derived a sample of elliptical galaxies that can be classified as isolated. From this we have investigated the neighbourhood of these galaxies to determine the frequency and radial distribution of faint galaxies around them and hence derive an estimate of their surrounding satellite population. The results are co...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید