Sciweavers

367 search results - page 19 / 74
» A finiteness structure on resource terms
Sort
View
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 7 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
WSC
1998
13 years 8 months ago
Bayesian Model Selection when the Number of Components is Unknown
In simulation modeling and analysis, there are two situations where there is uncertainty about the number of parameters needed to specify a model. The first is in input modeling w...
Russell C. H. Cheng
NIPS
2003
13 years 8 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
EMNLP
2010
13 years 5 months ago
Constraints Based Taxonomic Relation Classification
Determining whether two terms in text have an ancestor relation (e.g. Toyota and car) or a sibling relation (e.g. Toyota and Honda) is an essential component of textual inference ...
Quang Do, Dan Roth
TSP
2008
151views more  TSP 2008»
13 years 7 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar