Sciweavers

1088 search results - page 164 / 218
» Probabilistic query expansion using query logs
Sort
View
ER
2004
Springer
161views Database» more  ER 2004»
14 years 2 months ago
Towards a Statistically Semantic Web
The envisioned Semantic Web aims to provide richly annotated and explicitly structured Web pages in XML, RDF, or description logics, based upon underlying ontologies and thesauri. ...
Gerhard Weikum, Jens Graupmann, Ralf Schenkel, Mar...
FOCS
2009
IEEE
14 years 23 days ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
TKDE
2008
122views more  TKDE 2008»
13 years 8 months ago
Protection of Database Security via Collaborative Inference Detection
Malicious users can exploit the correlation among data to infer sensitive information from a series of seemingly innocuous data accesses. Thus, we develop an inference violation d...
Yu Chen, Wesley W. Chu
AAAI
1998
13 years 10 months ago
Probabilistic Frame-Based Systems
Two of the most important threads of work in knowledge representation today are frame-based representation systems (FRS's) and Bayesian networks (BNs). FRS's provide an ...
Daphne Koller, Avi Pfeffer
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 28 days ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh