1507 search results - page 188 / 302 » Separating Complexity Classes Using Structural Properties |
128
Voted
RSCTC
2000
Springer
15 years 5 months ago
2000
Springer
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
140
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
162
click to vote
JMLR
2012
13 years 4 months ago
2012
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
113
click to vote
MST
2010
15 years 20 days ago
2010
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
131
click to vote
HT
2005
ACM
15 years 7 months ago
2005
ACM
Hyper-Hitchcock is a hypervideo editor enabling the direct manipulation authoring of a particular form of hypervideo called “detail-on-demand video.” This form of hypervideo a...