Sciweavers

2520 search results - page 432 / 504
» The complexity of approximating entropy
Sort
View
PR
2000
106views more  PR 2000»
15 years 3 months ago
Non-linear image processing in hardware
A new ASIC capable of computing rank order "lters, weighted rank order "lters, standard erosion and dilation, soft erosion and dilation, order statistic soft erosion and...
Antonios Gasteratos, Ioannis Andreadis
140
Voted
AUTOMATICA
1999
145views more  AUTOMATICA 1999»
15 years 3 months ago
Control of systems integrating logic, dynamics, and constraints
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as mixed logical dy...
Alberto Bemporad, Manfred Morari
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 3 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
TIT
1998
69views more  TIT 1998»
15 years 3 months ago
Relationships Between the Constant Modulus and Wiener Receivers
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
Hanks H. Zeng, Lang Tong, C. Richard Johnson Jr.
TON
1998
145views more  TON 1998»
15 years 3 months ago
Adaptive wavelength routing in all-optical networks
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
Ahmed Mokhtar, Murat Azizoglu