1941 search results - page 98 / 389 » On the Hardness of Approximate Reasoning |
204
click to vote
FUIN
2006
15 years 6 months ago
2006
This paper introduces an approach to behavioral pattern identification as a part of a study of temporal patterns in complex dynamical systems. Rough set theory introduced by Zdzisl...
159
click to vote
WG
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
149
click to vote
ERLANG
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents a soft-typing system for the programming language Erlang. The system is based on two concepts; a (forward) data flow analysis that determines upper approximat...
140
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
167
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we design a low complexity linear MMSE decoder to recover the signal transmitted by M mobile users to a base station equipped with N receiving antennas, arranged as...