Sciweavers

276 search results - page 47 / 56
» Implicit Queries for Email
Sort
View
SIGMOD
1998
ACM
150views Database» more  SIGMOD 1998»
13 years 11 months ago
Extracting Schema from Semistructured Data
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
Svetlozar Nestorov, Serge Abiteboul, Rajeev Motwan...
DL
1994
Springer
191views Digital Library» more  DL 1994»
13 years 11 months ago
Corpus Linguistics for Establishing The Natural Language Content of Digital Library Documents
Digital Libraries will hold huge amounts of text and other forms of information. For the collections to be maximally useful, they must be highly organized with useful indexes and ...
Robert P. Futrelle, Xiaolan Zhang 0002, Yumiko Sek...
ICDT
1990
ACM
110views Database» more  ICDT 1990»
13 years 11 months ago
Beginnings of a Theory of General Database Completions
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
Stefan Brass
AIRS
2006
Springer
13 years 11 months ago
Improving Re-ranking of Search Results Using Collaborative Filtering
Search Engines today often return a large volume of results with possibly a few relevant results. The notion of relevance is subjective and depends on the user and the context of ...
U. Rohini, Vamshi Ambati
CSR
2006
Springer
13 years 11 months ago
All Semi-local Longest Common Subsequences in Subquadratic Time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
Alexandre Tiskin