Sciweavers

24188 search results - page 393 / 4838
» Computing on Encrypted Data
Sort
View
COMPGEOM
2005
ACM
15 years 6 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
SIGKDD
2000
96views more  SIGKDD 2000»
15 years 4 months ago
Phenomenal Data Mining: From Data to Phenomena
Phenomenal data mining finds relations between the data and the phenomena that give rise to data rather than just relations among the data. For example, suppose supermarket cash r...
John McCarthy
KDD
2007
ACM
335views Data Mining» more  KDD 2007»
16 years 5 months ago
Detecting changes in large data sets of payment card data: a case study
An important problem in data mining is detecting changes in large data sets. Although there are a variety of change detection algorithms that have been developed, in practice it c...
Chris Curry, Robert L. Grossman, David Locke, Stev...
ICDM
2007
IEEE
145views Data Mining» more  ICDM 2007»
15 years 11 months ago
Using Data Mining to Estimate Missing Sensor Data
Estimating missing sensor values is an inherent problem in sensor network applications; however, existing data estimation approaches do not apply well to the context of datastream...
Le Gruenwald, Hamed Chok, Mazen Aboukhamis
CORR
2007
Springer
123views Education» more  CORR 2007»
15 years 4 months ago
On Distributed Computation in Noisy Random Planar Networks
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
Yashodhan Kanoria, D. Manjunath