Sciweavers

4124 search results - page 350 / 825
» Improved Algorithms for Data Migration
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 7 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
SIGMOD
2010
ACM
236views Database» more  SIGMOD 2010»
15 years 10 months ago
Differentially private aggregation of distributed time-series with transformation and encryption
We propose PASTE, the first differentially private aggregation algorithms for distributed time-series data that offer good practical utility without any trusted server. PASTE add...
Vibhor Rastogi, Suman Nath
CASCON
2001
148views Education» more  CASCON 2001»
15 years 6 months ago
A Pareto model for OLAP view size estimation
On Line Analytical Processing (OLAP) aims at gaining useful information quickly from large amounts of data residing in a data warehouse. To improve the quickness of response to qu...
Thomas P. Nadeau, Toby J. Teorey
ICCV
2009
IEEE
16 years 10 months ago
Structure- and Motion-adaptive Regularization for High Accuracy Optic Flow
The accurate estimation of motion in image sequences is of central importance to numerous computer vision applications. Most competitive algorithms compute flow fields by minimi...
Andreas Wedel, Daniel Cremers, Thomas Pock, Horst ...
WWW
2006
ACM
16 years 5 months ago
Using symbolic objects to cluster web documents
Web Clustering is useful for several activities in the WWW, from automatically building web directories to improve retrieval performance. Nevertheless, due to the huge size of the...
Esteban Meneses, Oldemar Rodríguez-Rojas