Sciweavers

902 search results - page 36 / 181
» R* Search
Sort
View
CLEF
2009
Springer
15 years 28 days ago
Interactive Probabilistic Search for GikiCLEF
In this paper we will briefly describe the approaches taken by the Berkeley Cheshire Group for the GikiCLEF task of the QA track. Because the task was intended to model some aspec...
Ray R. Larson
PPOPP
2012
ACM
13 years 7 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
COMPGEOM
2009
ACM
15 years 6 months ago
PTAS for geometric hitting set problems via local search
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
SPIRE
2004
Springer
15 years 5 months ago
Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays
Abstract Searching information resources using mobile devices is affected by displays on which only a small fraction of the set of ranked documents can be displayed. In this study ...
Vishwa Vinay, Ingemar J. Cox, Natasa Milic-Fraylin...
HM
2009
Springer
165views Optimization» more  HM 2009»
15 years 4 months ago
Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search
Abstract. A Video-on-Demand system usually consists of a large number of independent video servers. In order to utilize network resources as efficiently as possible the overall net...
Jakob Walla, Mario Ruthmair, Günther R. Raidl