Sciweavers

8647 search results - page 344 / 1730
» The Container Selection Problem
Sort
View
EDBT
2009
ACM
127views Database» more  EDBT 2009»
15 years 11 months ago
Approximate substring selectivity estimation
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
ICIP
2008
IEEE
15 years 11 months ago
A fast level set algorithm for shape-based segmentation with multiple selective priors
This paper addresses the shape-based segmentation problem using level sets. In particular, we propose a fast algorithm to solve the piece-wise constant Chan-Vese segmentation mode...
Rachid Fahmi, Aly A. Farag
FUZZIEEE
2007
IEEE
15 years 10 months ago
Tolerance-based and Fuzzy-Rough Feature Selection
— One of the main obstacles facing the application of computational intelligence technologies in pattern recognition (and indeed in many other tasks) is that of dataset dimension...
Richard Jensen, Qiang Shen
ICCV
2007
IEEE
15 years 10 months ago
Two-View Motion Segmentation by Mixtures of Dirichlet Process with Model Selection and Outlier Removal
This paper presents a novel motion segmentation algorithm on the basis of mixture of Dirichlet process (MDP) models, a kind of nonparametric Bayesian framework. In contrast to pre...
Yong-Dian Jian, Chu-Song Chen
SOCO
2007
Springer
15 years 10 months ago
Aspect-Oriented Programming: Selecting and Exposing Object Paths
Aspects require access to the join point context in order to select and adapt join points. For this purpose, current aspect-oriented systems offer a large number of pointcut constr...
Mohammed Al-Mansari, Stefan Hanenberg, Rainer Unla...