Sciweavers

989 search results - page 148 / 198
» Version spaces and the consistency problem
Sort
View
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 6 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap
JMLR
2010
172views more  JMLR 2010»
15 years 20 days ago
Modeling annotator expertise: Learning when everybody knows a bit of something
Supervised learning from multiple labeling sources is an increasingly important problem in machine learning and data mining. This paper develops a probabilistic approach to this p...
Yan Yan, Rómer Rosales, Glenn Fung, Mark W....
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
15 years 9 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...
150
Voted
FUIN
2008
83views more  FUIN 2008»
15 years 6 months ago
Fault Diagnosis with Static and Dynamic Observers
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in t...
Franck Cassez, Stavros Tripakis
ECCC
2010
122views more  ECCC 2010»
15 years 4 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah