Sciweavers

8824 search results - page 228 / 1765
» On the Complexity of Real Functions
Sort
View
LICS
2012
IEEE
13 years 9 months ago
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
Serge Haddad, Sylvain Schmitz, Philippe Schnoebele...
EJC
2007
15 years 6 months ago
On some enumerative aspects of generalized associahedra
We prove a conjecture of F. Chapoton relating certain enumerative invariants of (a) the cluster complex associated by S. Fomin and A. Zelevinsky with a finite root system and (b)...
Christos A. Athanasiadis
ICIP
2001
IEEE
16 years 8 months ago
Color segmentation through independent anisotropic diffusion of complex chromaticity and lightness
This paper presents a new technique based on anisotropic diffusion for segmenting color images. This operation is accomplished through two independent anisotropic diffusion proces...
Luca Lucchese, Sanjit K. Mitra
IDEAS
2003
IEEE
86views Database» more  IDEAS 2003»
15 years 12 months ago
A Medium Complexity Discrete Model for Uncertain Spatial Data
This paper presents a method for representing uncertainty in spatial data in a database. The model presented requires moderate amounts of storage space. To compute the probability...
Erlend Tøssebro, Mads Nygård
ICANN
2001
Springer
15 years 11 months ago
Extracting Slow Subspaces from Natural Videos Leads to Complex Cells
Natural videos obtained from a camera mounted on a cat’s head are used as stimuli for a network of subspace energy detectors. The network is trained by gradient ascent on an obje...
Christoph Kayser, Wolfgang Einhäuser, Olaf D&...