Sciweavers

3946 search results - page 264 / 790
» The computational complexity of choice sets
Sort
View
DPD
2002
125views more  DPD 2002»
15 years 6 months ago
Parallel Mining of Outliers in Large Database
Data mining is a new, important and fast growing database application. Outlier (exception) detection is one kind of data mining, which can be applied in a variety of areas like mon...
Edward Hung, David Wai-Lok Cheung
PRL
2008
161views more  PRL 2008»
15 years 6 months ago
Automatic kernel clustering with a Multi-Elitist Particle Swarm Optimization Algorithm
This article introduces a scheme for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring groups in the data. T...
Swagatam Das, Ajith Abraham, Amit Konar
JUCS
2010
145views more  JUCS 2010»
15 years 5 months ago
Block-based Against Segmentation-based Texture Image Retrieval
Abstract: This paper concerns the best approach to the capture of local texture features for use in content-based image retrieval (CBIR) applications. From our previous work, two a...
Mohammad Faizal Ahmad Fauzi, Paul H. Lewis
CORR
2011
Springer
161views Education» more  CORR 2011»
14 years 10 months ago
A Panorama on Multiscale Geometric Representations, Intertwining Spatial, Directional and Frequency Selectivity
The richness of natural images makes the quest for optimal representations in image processing and computer vision challenging. The latter observation has not prevented the design...
Laurent Jacques, Laurent Duval, Caroline Chaux, Ga...
ITA
2002
163views Communications» more  ITA 2002»
15 years 6 months ago
Permissive strategies: from parity games to safety games
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the be...
Julien Bernet, David Janin, Igor Walukiewicz