Sciweavers

10542 search results - page 171 / 2109
» A General Notion of Useful Information
Sort
View
LATIN
2004
Springer
15 years 12 months ago
How Expressions Can Code for Automata
In this paper we investigate how it is possible to recover an automaton from a rational expression that has been computed from that automaton. The notion of derived term of an expr...
Sylvain Lombardy, Jacques Sakarovitch
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
16 years 7 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
15 years 7 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
ICC
2009
IEEE
133views Communications» more  ICC 2009»
16 years 1 months ago
On Quantizer Design for Soft Values in the Multiple-Access Relay Channel
—A network with two sources, one relay, and one destination is considered. Under the assumption of noisy sourcerelay links causing the relay to be unable to decode without error,...
Georg Zeitler, Ralf Koetter, Gerhard Bauch, Jö...
IR
2000
15 years 6 months ago
Retrieving with Good Sense
ct Although always present in text, word sense ambiguity only recently became regarded as a problem to information retrieval which was potentially solvable. The growth of interest ...
Mark Sanderson