Sciweavers

153 search results - page 9 / 31
» On an equivalence in discrete extremal problems
Sort
View
DCC
2002
IEEE
14 years 6 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
JC
2000
135views more  JC 2000»
13 years 6 months ago
Decision Problems in Quadratic Function Fields of High Genus
This paper provides verification procedures for a number of decision problems in quadratic function fields of odd characteristic, thereby establishing membership of these problems...
Renate Scheidler
COMPGEOM
2004
ACM
14 years 4 days ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount
AUTOMATICA
2000
94views more  AUTOMATICA 2000»
13 years 6 months ago
Mutually nonblocking supervisory control of discrete event systems
For discrete event systems, modular supervisory control refers to modular design of a supervisor when multiple control specifications are given. This problem has been studied for ...
M. Fabian, R. Kumar
IPSN
2003
Springer
13 years 12 months ago
Maximum Mutual Information Principle for Dynamic Sensor Query Problems
In this paper we study a dynamic sensor selection method for Bayesian filtering problems. In particular we consider the distributed Bayesian Filtering strategy given in [1] and sh...
Emre Ertin, John W. Fisher, Lee C. Potter