Sciweavers

7522 search results - page 109 / 1505
» Spacing memetic algorithms
Sort
View
DKE
2008
72views more  DKE 2008»
15 years 21 days ago
On space constrained set selection problems
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
Themis Palpanas, Nick Koudas, Alberto O. Mendelzon
PR
2006
111views more  PR 2006»
15 years 16 days ago
The Bhattacharyya space for feature selection and its application to texture segmentation
A feature selection methodology based on a novel Bhattacharyya space is presented and illustrated with a texture segmentation problem. The Bhattacharyya space is constructed from ...
Constantino Carlos Reyes-Aldasoro, Abhir Bhalerao
113
Voted
ICCV
1998
IEEE
16 years 2 months ago
Wormholes in Shape Space: Tracking Through Discontinuous Changes in Shape
Existing object tracking algorithms generally use some form of local optimisation, assuming that an object's position and shape change smoothly over time. In some situations ...
Tony Heap, David Hogg
119
Voted
WADS
2009
Springer
265views Algorithms» more  WADS 2009»
15 years 7 months ago
A Distribution-Sensitive Dictionary with Low Space Overhead
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
Prosenjit Bose, John Howat, Pat Morin
IPPS
2008
IEEE
15 years 7 months ago
Parallel option pricing with Fourier Space Time-stepping method on Graphics Processing Units
With the evolution of Graphics Processing Units (GPUs) into powerful and cost-efficient computing architectures, their range of application has expanded tremendously, especially i...
Vladimir Surkov