Sciweavers

2031 search results - page 204 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
TC
2002
14 years 10 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...
NCA
2007
IEEE
14 years 10 months ago
Using evolution to improve neural network learning: pitfalls and solutions
: Autonomous neural network systems typically require fast learning and good generalization performance, and there is potentially a trade-off between the two. The use of evolutiona...
John A. Bullinaria
PAMI
2007
101views more  PAMI 2007»
14 years 10 months ago
Surface Dependent Representations for Illumination Insensitive Image Comparison
—We consider the problem of matching images to tell whether they come from the same scene viewed under different lighting conditions. We show that the surface characteristics det...
Margarita Osadchy, David W. Jacobs, Michael Linden...
PAMI
2007
193views more  PAMI 2007»
14 years 10 months ago
Robust Object Recognition with Cortex-Like Mechanisms
—We introduce a new general framework for the recognition of complex visual scenes, which is motivated by biology: We describe a hierarchical system that closely follows the orga...
Thomas Serre, Lior Wolf, Stanley M. Bileschi, Maxi...
PAMI
2007
176views more  PAMI 2007»
14 years 10 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas