Sciweavers

101 search results - page 20 / 21
» Bayes Networks for Estimating the Number of Solutions to a C...
Sort
View
ICDE
2006
IEEE
160views Database» more  ICDE 2006»
14 years 10 months ago
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003...
PAMI
2011
13 years 3 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
BMCBI
2008
160views more  BMCBI 2008»
13 years 8 months ago
Feature selection environment for genomic applications
Background: Feature selection is a pattern recognition approach to choose important variables according to some criteria in order to distinguish or explain certain phenomena (i.e....
Fabrício Martins Lopes, David Correa Martin...
SIGMETRICS
2008
ACM
101views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
How to parameterize models with bursty workloads
Although recent advances in theory indicate that burstiness in the service time process can be handled effectively by queueing models (e.g., MAP queueing networks [2]), there is a...
Giuliano Casale, Ningfang Mi, Ludmila Cherkasova, ...
RAID
2004
Springer
14 years 1 months ago
RheoStat: Real-Time Risk Management
As the frequency of attacks faced by the average host connected to the Internet increases, reliance on manual intervention for response is decreasingly tenable. Operating system an...
Ashish Gehani, Gershon Kedem