Sciweavers

1964 search results - page 256 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
13 years 12 months ago
An empirical investigation of how and why neutrality affects evolutionary search
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...
Edgar Galván López, Riccardo Poli
GD
2005
Springer
14 years 1 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
11 years 10 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
CVPR
1996
IEEE
14 years 10 months ago
Combining greyvalue invariants with local constraints for object recognition
This paper addresses the problem of recognizing objects in large image databases. The method is based on local characteristics which are invariant to simzlarity transformations in...
Cordelia Schmid, Roger Mohr
ICCV
2003
IEEE
14 years 10 months ago
Learning How to Inpaint from Global Image Statistics
Inpainting is the problem of filling-in holes in images. Considerable progress has been made by techniques that use the immediate boundary of the hole and some prior information o...
Anat Levin, Assaf Zomet, Yair Weiss