Sciweavers

15254 search results - page 55 / 3051
» A k
Sort
View
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 3 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
DEBS
2008
ACM
15 years 1 months ago
Top-k/w publish/subscribe: finding k most relevant publications in sliding time window w
Existing content-based publish/subscribe systems are designed assuming that all matching publications are equally relevant to a subscription. As we cannot know in advance the dist...
Kresimir Pripuzic, Ivana Podnar Zarko, Karl Aberer
BMCBI
2010
123views more  BMCBI 2010»
14 years 12 months ago
Decoding HMMs using the k best paths: algorithms and applications
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
Daniel G. Brown 0001, Daniil Golod
DKE
2008
79views more  DKE 2008»
14 years 12 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
BMCBI
2008
181views more  BMCBI 2008»
14 years 10 months ago
Assessing batch effects of genotype calling algorithm BRLMM for the Affymetrix GeneChip Human Mapping 500 K array set using 270
Background: Genome-wide association studies (GWAS) aim to identify genetic variants (usually single nucleotide polymorphisms [SNPs]) across the entire human genome that are associ...
Huixiao Hong, Zhenqiang Su, Weigong Ge, Leming M. ...