Sciweavers

562 search results - page 66 / 113
» A case study in web search using TREC algorithms
Sort
View
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
15 years 5 months ago
Extracting Structured Data from Web Pages
Many web sites contain large sets of pages generated using a common template or layout. For example, Amazon lays out the author, title, comments, etc. in the same way in all its b...
Arvind Arasu, Hector Garcia-Molina
SIGIR
2004
ACM
15 years 5 months ago
An effective approach to document retrieval via utilizing WordNet and recognizing phrases
Noun phrases in queries are identified and classified into four types: proper names, dictionary phrases, simple phrases and complex phrases. A document has a phrase if all content...
Shuang Liu, Fang Liu, Clement T. Yu, Weiyi Meng
FOCS
2004
IEEE
15 years 3 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
WWW
2003
ACM
16 years 16 days ago
Adaptive on-line page importance computation
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
Serge Abiteboul, Mihai Preda, Gregory Cobena
AMAI
2004
Springer
15 years 5 months ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos