Sciweavers

467 search results - page 22 / 94
» Processing top k queries from samples
Sort
View
VLDB
2002
ACM
161views Database» more  VLDB 2002»
13 years 8 months ago
Distributed Search over the Hidden Web: Hierarchical Database Sampling and Selection
Many valuable text databases on the web have non-crawlable contents that are "hidden" behind search interfaces. Metasearchers are helpful tools for searching over many s...
Panagiotis G. Ipeirotis, Luis Gravano
CEAS
2006
Springer
14 years 29 days ago
Using Early Results from the 'spamHINTS' Project to Estimate an ISP Abuse Team's Task
ISPs operate "abuse" teams to deal with reports of inappropriate email being sent by their customers. Currently, the majority of this work is dealing with insecure syste...
Richard Clayton
ICDE
2004
IEEE
138views Database» more  ICDE 2004»
14 years 10 months ago
Making the Pyramid Technique Robust to Query Types and Workloads
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
Rui Zhang 0003, Beng Chin Ooi, Kian-Lee Tan
INFOCOM
2012
IEEE
11 years 11 months ago
Secure top-k query processing via untrusted location-based service providers
Abstract—This paper considers a novel distributed system for collaborative location-based information generation and sharing which become increasingly popular due to the explosiv...
Rui Zhang 0007, Yanchao Zhang, Chi Zhang
ICASSP
2009
IEEE
14 years 4 months ago
Single and multichannel sampling of bilevel polygons using exponential splines
In this paper we present a novel approach for sampling and reconstructing any K-sided convex and bilevel polygon with the use of exponential splines [1]. It will be shown that wit...
Hojjat Akhondi Asl, Pier Luigi Dragotti