Sciweavers

1802 search results - page 351 / 361
» Model-based Theory Combination
Sort
View
IPL
2007
105views more  IPL 2007»
13 years 9 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
IVC
2007
99views more  IVC 2007»
13 years 9 months ago
On the Bayes fusion of visual features
We consider the problem of image classification when more than one visual feature is available. In such cases, Bayes fusion offers an attractive solution by combining the result...
Xiaojin Shi, Roberto Manduchi
TSP
2008
101views more  TSP 2008»
13 years 8 months ago
Bayesian Compressive Sensing
The data of interest are assumed to be represented as N-dimensional real vectors, and these vectors are compressible in some linear basis B, implying that the signal can be recons...
Shihao Ji, Ya Xue, Lawrence Carin
JSYML
2007
100views more  JSYML 2007»
13 years 8 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
AAMAS
2002
Springer
13 years 8 months ago
Adapting Populations of Agents
We control a population of interacting software agents. The agents have a strategy, and receive a payoff for executing that strategy. Unsuccessful agents become extinct. We investi...
Philippe De Wilde, Maria Chli, Luís Correia...