1091 search results - page 167 / 219 » On the temporal dimension of search |
144
click to vote
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
— 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...
INFOVIS
2005
IEEE
15 years 7 months ago
2005
IEEE
The discrete nature of categorical data makes it a particular challenge for visualization. Methods that work very well for continuous data are often hardly usable with categorical...
118
click to vote
DAGM
2010
Springer
15 years 2 months ago
2010
Springer
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...
125
click to vote
BMCBI
2008
15 years 1 months ago
2008
Background: The combination of gene expression profiling with linkage analysis has become a powerful paradigm for mapping gene expression quantitative trait loci (eQTL). To date, ...
131
click to vote
COMGEO
2007
ACM
15 years 1 months ago
2007
ACM
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...