Sciweavers

779 search results - page 10 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
FOCS
2000
IEEE
13 years 12 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 9 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
FQAS
2009
Springer
186views Database» more  FQAS 2009»
13 years 5 months ago
Dynamically Personalizing Search Results for Mobile Users
Abstract. We introduce a novel situation-aware approach to personalize search results for mobile users. By providing a mobile user with appropriate information that dynamically sat...
Ourdia Bouidghaghen, Lynda Tamine-Lechani, Mohand ...
WWW
2004
ACM
14 years 8 months ago
A hierarchical monothetic document clustering algorithm for summarization and browsing search results
Organizing Web search results into a hierarchy of topics and subtopics facilitates browsing the collection and locating results of interest. In this paper, we propose a new hierar...
Krishna Kummamuru, Rohit Lotlikar, Shourya Roy, Ka...
WWW
2009
ACM
14 years 8 months ago
Visual diversification of image search results
Due to the reliance on the textual information associated with an image, image search engines on the Web lack the discriminative power to deliver visually diverse search results. ...
Reinier H. van Leuken, Lluis Garcia Pueyo, Ximena ...