1091 search results - page 151 / 219 » Approximation in Databases |
121
click to vote
PKDD
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This paper presents a novel feature selection method for classification of high dimensional data, such as those produced by microarrays. It includes a partial supervisio...
150
Voted
BIBE
2008
IEEE
15 years 9 months ago
2008
IEEE
— This paper describes a design and implementation of the Smith-Waterman algorithm accelerated on the graphics processing unit (GPU). Our method is implemented using compute uni...
118
click to vote
DASFAA
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract. Moving object environments are characterized by large numbers of objects continuously sending location updates. At times, data arrival rates may spike up, causing the loa...
127
click to vote
ICDE
2007
IEEE
15 years 9 months ago
2007
IEEE
We consider the problem of semantic load shedding for continuous queries containing window joins on multiple data streams and propose a robust approach that is effective with the ...
105
Voted
SSDBM
2007
IEEE
15 years 8 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...