Titlebook: Database and Expert Systems Applications; 25th International C Hendrik Decker,Lenka Lhotská,Roland R. Wagner Conference proceedings 2014 Sp

擺動(dòng)

OVERT

Ontology Driven Indexing: Application to Personalized Information Retrievalw that system responses are entirely personalized and semantically enhanced by the ontological representation behind. These contributions are designed to allow the integration of external knowledge and their fundations enable an adaptation to various applications.

推延

carotid-bruit

諷刺滑稽戲劇

On Continuous Spatial Skyline Queries over a Line Segmentconstraint of .. We propose two methods to solve the problem. In the first method, we find some special location points which partition . into sub-segments and also make the skylines in the adjacent sub-segments different. In the second method, we apply some properties to identify data points which

值得

A Memory-Efficient Tree Edit Distance Algorithmin memory bottleneck. We show the correctness of our approach and prove an upper bound for the memory usage. Our empirical evaluation confirms the low memory requirements and shows that in practice our algorithm performs better than the analytic guarantees suggest.

使隔離

Blemish

https://doi.org/10.1007/978-981-13-0722-5 to the notion of sustainable constraint writing, we introduce a symbolic viewpoint on model manipulation that complements current mainstream viewpoints. The symbolic viewpoint is about denying a model/data level divide. We discuss sustainable constraint writing with respect to further issues in con

聽(tīng)寫(xiě)

The Political Economy of the USSRm random sampling of a rooted subtree with prescribed weight is unfortunately intractable. However, we are able to identify several practical cases that are tractable. The first case is uniform random sampling of a rooted subtree with prescribed size; the second case restricts to binary weights. For

indifferent