Sciweavers

1984 search results - page 32 / 397
» The colourful feasibility problem
Sort
View
CEC
2007
IEEE
14 years 4 months ago
Comparing bio-inspired algorithms in constrained optimization problems
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
Efrén Mezura-Montes, Blanca Cecilia Lopez-R...
DAM
2006
191views more  DAM 2006»
13 years 10 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
ICDAR
2009
IEEE
13 years 7 months ago
Robust Extraction of Text from Camera Images
Text within a camera grabbed image can contain a huge amount of meta data about that scene. Such meta data can be useful for identification, indexing and retrieval purposes. Detec...
Shyama Prosad Chowdhury, Soumyadeep Dhar, Amit Kum...
SIGIR
1992
ACM
14 years 1 months ago
Bead: Explorations in Information Visualization
ct We describe work on the visualization of bibliographic data and, to aid in this task, the application of numerical techniques for multidimensional scaling. Many areas of scienti...
Matthew Chalmers, Paul Chitson
CAIP
1995
Springer
189views Image Analysis» more  CAIP 1995»
14 years 1 months ago
Spatial and Feature Space Clustering: Applications in Image Analysis
We propose a novel approach to image segmentation, called feature and spatial domain clustering. The method is devised to group pixel data by taking into account simultaneously bo...
Jiri Matas, Josef Kittler