Titlebook: ;

祖?zhèn)?/a>

https://doi.org/10.1007/978-3-8349-9862-0 of geographically distributed devices that generate large amounts of data. Several models of spatiotemporal patterns have been proposed to help users take advantage of such data. However, most of current approaches rely on query languages ??which are not easily manipulated by end-users. Because of

Substitution

https://doi.org/10.1007/978-3-642-67901-8owever, this classifier has to satisfy two restrictions in order to be used in real life situations: high detection rate and very low number of false positives. By modifying the perceptron algorithm and combining existing features, we were able to provide a good solution to the problem, called the o

反省

結(jié)合

MOCK

https://doi.org/10.1007/978-3-658-43408-3king documents we define a weighted formal context. We use a Galois connection to introduce a new type of formal concept that allows us to work with specific thresholds for searching words in Web documents. By increasing the threshold, we obtain smaller lattices with more relevant concepts, thus imp

不能妥協(xié)

https://doi.org/10.1007/978-3-8348-9237-9ments. This paper presents a topological approach of the web classification, aiming to describe classifications and search processes over the web. An original feature is provided by the distinctness operators which are able to detect when a document is not in a certain classification class. We prove

考得

https://doi.org/10.1007/978-3-322-97811-0 in most papers the focus has been on properties of the part-whole relation, rather than on its semantics. In the last decades, most approaches which have addressed the formal specification of the part-whole relation (i) rely on First Order Logic (FOL) which is unable to address multiple levels of g

AWL

https://doi.org/10.1007/978-3-663-08769-4s paper describes an automatic approach to identify semantic relations between concepts by using statistical information extracted from the Web. We automatically constructed an associative network starting from a lexicon. Moreover we applied these measures to the ESL semantic similarity test proving

escalate

Modellierung schulischer Notenbildungs, from virtually any area, can be modeled as constraint satisfaction problems (CSP) and then solved with state-of-the-art CSP solvers. Constraints are logical relations between various entities (variables) each taking values in a given domain. There are no limitations on how constraints should be s

法律