Sciweavers

1421 search results - page 208 / 285
» Algorithms for subsequence combinatorics
Sort
View
WWW
2008
ACM
16 years 4 months ago
Investigation of partial query proximity in web search
Proximity of query terms in a document is an important criterion in IR. However, no investigation has been made to determine the most useful term sequences for which proximity sho...
Jing Bai, Yi Chang, Hang Cui, Zhaohui Zheng, Gordo...
WWW
2004
ACM
16 years 4 months ago
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
In peer-to-peer networks, finding the appropriate answer for an information request, such as the answer to a query for RDF(S) data, depends on selecting the right peer in the netw...
Christoph Tempich, Steffen Staab, Adrian Wranik
WWW
2002
ACM
16 years 4 months ago
Translating XSLT programs to Efficient SQL queries
We present an algorithm for translating XSLT programs into SQL. Our context is that of virtual XML publishing, in which a single XML view is defined from a relational database, an...
Sushant Jain, Ratul Mahajan, Dan Suciu
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
16 years 4 months ago
Mining reference tables for automatic text segmentation
Automatically segmenting unstructured text strings into structured records is necessary for importing the information contained in legacy sources and text collections into a data ...
Eugene Agichtein, Venkatesh Ganti
SIGMOD
2009
ACM
189views Database» more  SIGMOD 2009»
16 years 4 months ago
Query segmentation using conditional random fields
A growing mount of available text data are being stored in relational databases, giving rise to an increasing need for the RDBMSs to support effective text retrieval. In this pape...
Xiaohui Yu, Huxia Shi