727 search results - page 60 / 146 » Private approximation of search problems |
ICDE
2009
IEEE
14 years 11 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
ECAI
2004
Springer
14 years 3 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
ICDE
2006
IEEE
14 years 11 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
HICSS
2006
IEEE
14 years 4 months ago
2006
IEEE
There are today several methods and standards available for assessment of the level of information security in an enterprise. A problem with these assessment methods is that they ...
BIS
2007
13 years 11 months ago
2007
In this paper we introduce a prototype job portal which uses semantically annotated job offers and applicants. In our opinion, using Semantic Web technologies substantially increa...