Sciweavers

42 search results - page 8 / 9
» Fast and Memory Efficient Mining of High Utility Itemsets in...
Sort
View
JPDC
2008
135views more  JPDC 2008»
13 years 6 months ago
Fast parallel GPU-sorting using a hybrid algorithm
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...
Erik Sintorn, Ulf Assarsson
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
14 years 7 months ago
Spatial scan statistics: approximations and performance study
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
Deepak Agarwal, Andrew McGregor, Jeff M. Phillips,...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
13 years 11 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
BMCBI
2010
144views more  BMCBI 2010»
13 years 7 months ago
Graph-based clustering and characterization of repetitive sequences in next-generation sequencing data
Background: The investigation of plant genome structure and evolution requires comprehensive characterization of repetitive sequences that make up the majority of higher plant nuc...
Petr Novák, Pavel Neumann, Jirí Maca...
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
14 years 7 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...