Sciweavers

198 search results - page 19 / 40
» Tensor Rank: Some Lower and Upper Bounds
Sort
View
AUTOMATICA
2005
152views more  AUTOMATICA 2005»
14 years 10 months ago
Identification of dynamical systems with a robust interval fuzzy model
In this paper we present a new method of interval fuzzy model identification. The method combines a fuzzy identification methodology with some ideas from linear programming theory...
Igor Skrjanc, Saso Blazic, Osvaldo E. Agamennoni
COCOA
2010
Springer
14 years 8 months ago
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
Peter Damaschke, Azam Sheikh Muhammad
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 3 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
LCTRTS
2010
Springer
15 years 4 days ago
Resilience analysis: tightening the CRPD bound for set-associative caches
In preemptive real-time systems, scheduling analyses need—in addition to the worst-case execution time—the context-switch cost. In case of preemption, the preempted and the pr...
Sebastian Altmeyer, Claire Maiza, Jan Reineke
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
14 years 8 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud