Sciweavers

2162 search results - page 292 / 433
» Distributed Computation of Web Queries Using Automata
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
15 years 5 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
ICTIR
2009
Springer
15 years 4 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette
CIKM
2008
Springer
15 years 8 months ago
SoRec: social recommendation using probabilistic matrix factorization
Data sparsity, scalability and prediction quality have been recognized as the three most crucial challenges that every collaborative filtering algorithm or recommender system conf...
Hao Ma, Haixuan Yang, Michael R. Lyu, Irwin King
CIVR
2007
Springer
128views Image Analysis» more  CIVR 2007»
16 years 17 days ago
3D-Model search engine from photos
In this paper, we present the FOX-MIIRE 3D-Model Search Engine. Our search engine is based on Adaptive Views Vlustering (AVC) algorithm [4]. The AVC method uses statistical model ...
Tarik Filali Ansary, Jean-Philippe Vandeborre, Moh...
AINA
2009
IEEE
15 years 4 months ago
Approximating Travel Times Using Opportunistic Networking
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...
Rudi Ball, Naranker Dulay