Sciweavers

3778 search results - page 260 / 756
» Erdos-Ko-Rado for three sets
Sort
View
PC
2006
153views Management» more  PC 2006»
15 years 5 months ago
Algorithmic skeletons meeting grids
In this work, we discuss an extension of the set of principles that should guide the future design and development of skeletal programming systems, as defined by Cole in his ``pra...
Marco Danelutto, Marco Aldinucci
CN
2004
100views more  CN 2004»
15 years 5 months ago
Study of long-duration MPEG-trace segmentation methods for developing frame-size-based traffic models
Texture and temporal variations in scenes, and peculiarities of MPEG compression algorithms result in very complex frame-size data sets for any long-duration variable bit rate (VB...
Uttam K. Sarkar, Subramanian Ramakrishnan, Dilip S...
EC
2008
153views ECommerce» more  EC 2008»
15 years 5 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
IJCV
2010
186views more  IJCV 2010»
15 years 4 months ago
An Approach to the Parameterization of Structure for Fast Categorization
A decomposition is described, which parameterizes the geometry and appearance of contours and regions of gray-scale images with the goal of fast categorization. To express the con...
Christoph Rasche
CGF
2010
157views more  CGF 2010»
15 years 3 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen