Sciweavers

501 search results - page 78 / 101
» Event-Feeded Dimension Solution
Sort
View
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
15 years 6 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
ESA
2007
Springer
176views Algorithms» more  ESA 2007»
15 years 6 months ago
Arrangements in Geometry: Recent Advances and Challenges
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
Micha Sharir
INFOVIS
2003
IEEE
15 years 5 months ago
Mapping Nominal Values to Numbers for Effective Visualization
Data sets with a large number of nominal variables, some with high cardinality, are becoming increasingly common and need to be explored. Unfortunately, most existing visual explo...
Geraldine E. Rosario, Elke A. Rundensteiner, David...
CIKM
2003
Springer
15 years 5 months ago
High dimensional reverse nearest neighbor queries
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
Amit Singh, Hakan Ferhatosmanoglu, Ali Saman Tosun
LSSC
2001
Springer
15 years 4 months ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel