Sciweavers

522 search results - page 35 / 105
» Necessary but Not Sufficient
Sort
View
HYBRID
2010
Springer
13 years 9 months ago
Identifiability of discrete-time linear switched systems
In this paper we study the identifiability of linear switched systems (LSSs ) in discrete-time. The question of identifiability is central to system identification, as it sets the...
Mihály Petreczky, Laurent Bako, Jan H. van ...
OPODIS
2008
13 years 9 months ago
With Finite Memory Consensus Is Easier Than Reliable Broadcast
We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus ...
Carole Delporte-Gallet, Stéphane Devismes, ...
OWLED
2008
13 years 9 months ago
GO faster ChEBI with Reasonable Biochemistry
Chemical Entities of Biological Interest (ChEBI) is a database and ontology that represents biochemical knowledge about small molecules. Recent changes to the ontology have created...
Duncan Hull
UAI
2008
13 years 9 months ago
Almost Optimal Intervention Sets for Causal Discovery
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
Frederick Eberhardt
ESANN
2006
13 years 9 months ago
Degeneracy in model selection for SVMs with radial Gaussian kernel
We consider the model selection problem for support vector machines applied to binary classification. As the data generating process is unknown, we have to rely on heuristics as mo...
Tobias Glasmachers