9405 search results - page 1161 / 1881 » Computing a Model of Set Theory |
192
click to vote
JSYML
2010
15 years 2 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
161
click to vote
RECOMB
2001
Springer
16 years 7 months ago
2001
Springer
Recent studies (Alizadeh et al, [1]; Bittner et al,[5]; Golub et al, [11]) demonstrate the discovery of putative disease subtypes from gene expression data. The underlying computa...
215
click to vote
FOSSACS
2007
Springer
16 years 1 months ago
2007
Springer
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
203
click to vote
INFOVIS
2003
IEEE
16 years 22 days ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
205
click to vote
ECCV
2010
Springer
16 years 18 days ago
2010
Springer
Abstract. We use a simple yet powerful higher-order conditional random field (CRF) to model optical flow. It consists of a standard photoconsistency cost and a prior on affine mo...