Sciweavers

1814 search results - page 13 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
PODS
2004
ACM
207views Database» more  PODS 2004»
14 years 7 months ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri
COMPGEOM
2010
ACM
14 years 24 days ago
Improving the first selection lemma in R3
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfra...
INFOVIS
2003
IEEE
14 years 1 months ago
Improving Hybrid MDS with Pivot-Based Searching
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
Alistair Morrison, Matthew Chalmers
RECSYS
2009
ACM
14 years 2 months ago
A partial-order based active cache for recommender systems
Recommender systems aim to substantially reduce information overload by suggesting lists of similar items that users may find interesting. Caching has been a useful technique for...
Umar Qasim, Vincent Oria, Yi-fang Brook Wu, Michae...
IIS
2004
13 years 9 months ago
Conceptual Clustering Using Lingo Algorithm: Evaluation on Open Directory Project Data
Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search hits list, returned from a search engine. In this paper we present t...
Stanislaw Osinski, Dawid Weiss