Sciweavers

1388 search results - page 236 / 278
» Querying Linguistic Trees
Sort
View
ADBIS
2008
Springer
117views Database» more  ADBIS 2008»
15 years 2 months ago
Reclassification of Linearly Classified Data Using Constraint Databases
In many problems the raw data is already classified according to a variety of features using some linear classification algorithm but needs to be reclassified. We introduce a novel...
Peter Z. Revesz, Thomas Triplet
95
Voted
DEBS
2007
ACM
15 years 2 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
100
Voted
MEDINFO
2007
124views Healthcare» more  MEDINFO 2007»
15 years 1 months ago
Experiments with Hierarchical Concept-Based Search
Many digital libraries use hierarchical indexing schema, such as MeSH to enable concept based search in the retrieval phase. However, improving or outperforming the traditional fu...
Robert Moskovitch, Roee Sa'adon, Eytan Behiri, Sus...
DATESO
2004
100views Database» more  DATESO 2004»
15 years 1 months ago
Storage and Retrieval of First Order Logic Terms in a Database
In this paper we present a storage method for sets of first order logic terms in a relational database using function symbols based indexing method of Discrimination trees. This is...
Peter Gurský
SEBD
1997
158views Database» more  SEBD 1997»
15 years 1 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...