420 search results - page 39 / 84 » Some Algorithmic Problems in Polytope Theory |
ACM
1995
15 years 1 months ago
1995
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
TIT
2002
14 years 9 months ago
2002
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
We present an extension of the Dynamics Based Control (DBC) paradigm to environment models based on Predictive State Representations (PSRs). We show an approximate greedy version ...
257
click to vote
ICA
2012
Springer
13 years 5 months ago
2012
Springer
Independent component analysis (ICA) is possibly the most widespread approach to solve the blind source separation (BSS) problem. Many different algorithms have been proposed, tog...
STOC
1992
ACM
15 years 1 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...