Sciweavers

2514 search results - page 339 / 503
» On the Computation of Approximations of Database Queries
Sort
View
WWW
2007
ACM
16 years 7 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
KDD
2004
ACM
216views Data Mining» more  KDD 2004»
16 years 7 months ago
GPCA: an efficient dimension reduction scheme for image compression and retrieval
Recent years have witnessed a dramatic increase in the quantity of image data collected, due to advances in fields such as medical imaging, reconnaissance, surveillance, astronomy...
Jieping Ye, Ravi Janardan, Qi Li
SIGMOD
2011
ACM
283views Database» more  SIGMOD 2011»
14 years 9 months ago
iReduct: differential privacy with reduced relative errors
Prior work in differential privacy has produced techniques for answering aggregate queries over sensitive data in a privacypreserving way. These techniques achieve privacy by addi...
Xiaokui Xiao, Gabriel Bender, Michael Hay, Johanne...
GIS
2006
ACM
15 years 6 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
CIKM
2007
Springer
16 years 1 months ago
Effective keyword search for valuable lcas over xml documents
In this paper, we study the problem of effective keyword search over XML documents. We begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately and ...
Guoliang Li, Jianhua Feng, Jianyong Wang, Lizhu Zh...