Sciweavers

1679 search results - page 130 / 336
» Pointcuts as Functional Queries
Sort
View
PVLDB
2010
252views more  PVLDB 2010»
14 years 11 months ago
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu
PODS
2009
ACM
134views Database» more  PODS 2009»
16 years 5 months ago
Relationship privacy: output perturbation for queries with joins
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...
Vibhor Rastogi, Michael Hay, Gerome Miklau, Dan Su...
225
Voted
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
16 years 4 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
15 years 10 months ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...
142
Voted
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 8 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...