Sciweavers

4536 search results - page 591 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 7 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
MICCAI
2003
Springer
16 years 7 months ago
Three-Dimensional Segmentation of Brain Aneurysms in CTA Using Non-parametric Region-Based Information and Implicit Deformable M
Abstract. Knowledge of brain aneurysm dimensions is essential in minimally invasive surgical interventions using Guglielmi Detachable Coils. These parameters are obtained in clinic...
Monica Hernandez, Alejandro F. Frangi, Guillermo S...
ICML
2008
IEEE
16 years 7 months ago
Modeling interleaved hidden processes
Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by as...
Niels Landwehr
ICML
2005
IEEE
16 years 7 months ago
Near-optimal sensor placements in Gaussian processes
When monitoring spatial phenomena, which are often modeled as Gaussian Processes (GPs), choosing sensor locations is a fundamental task. A common strategy is to place sensors at t...
Carlos Guestrin, Andreas Krause, Ajit Paul Singh
ICML
2002
IEEE
16 years 7 months ago
Diffusion Kernels on Graphs and Other Discrete Input Spaces
The application of kernel-based learning algorithms has, so far, largely been confined to realvalued data and a few special data types, such as strings. In this paper we propose a...
Risi Imre Kondor, John D. Lafferty