Sciweavers

660 search results - page 93 / 132
» Fuzzy Matching of Web Queries to Structured Data
Sort
View
COMPGEOM
2005
ACM
14 years 11 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
SIGIR
2010
ACM
15 years 1 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
LREC
2010
169views Education» more  LREC 2010»
14 years 11 months ago
An LMF-based Web Service for Accessing WordNet-type Semantic Lexicons
This paper describes a Web service for accessing WordNet-type semantic lexicons. The central idea behind the service design is: given a query, the primary functionality of lexicon...
Savas Ali Bora, Yoshihiko Hayashi, Monica Monachin...
PREMI
2011
Springer
14 years 19 days ago
Finding Potential Seeds through Rank Aggregation of Web Searches
This paper presents a potential seed selection algorithm for web crawlers using a gain - share scoring approach. Initially we consider a set of arbitrarily chosen tourism queries. ...
Rajendra Prasath, Pinar Öztürk
COMPGEOM
2001
ACM
15 years 1 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun