Sciweavers

2944 search results - page 72 / 589
» Improving Bound Propagation
Sort
View
STACS
2009
Springer
14 years 2 months ago
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
Andre Gronemeier
ICAI
2008
13 years 11 months ago
A Tabu Based Neural Network Training Algorithm for Equalization of Communication Channels
: This paper presents a new approach to equalization of communication channels using Artificial Neural Networks (ANNs). A novel method of training the ANNs using Tabu based Back Pr...
Jitendriya Kumar Satapathy, Konidala Ratna Subhash...
INFOCOM
2010
IEEE
13 years 8 months ago
On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks
We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carrie...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
ICRA
2002
IEEE
140views Robotics» more  ICRA 2002»
14 years 2 months ago
Using Multiple Disparity Hypotheses for Improved Indoor Stereo
This paper describes the design and implementation of an algorithm for improving the performance of stereo vision in environments presenting repetitive patterns or regions with re...
Cristian Dima, Simon Lacroix
ECAI
2010
Springer
13 years 8 months ago
Improving the Global Constraint SoftPrec
A soft global constraint SOFTPREC has been proposed recently for solving optimisation problems involving precedence relations. In this paper we present new pruning rules for this g...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...