3946 search results - page 282 / 790 » The computational complexity of choice sets |
290
Voted
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
In many modern data management settings, data is queried from a central node or nodes, but is stored at remote sources. In such a setting it is common to perform "pushstyle&qu...
182
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Bayesian analysis is a popular subspace based face recognition method. It casts the face recognition task into a binary classification problem with each of the two classes, intrap...
173
click to vote
COMGEO
1998
ACM
15 years 6 months ago
1998
ACM
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
151
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
This paper presents a novel extension of Hidden Markov Models (HMMs): type-2 fuzzy HMMs (type-2 FHMMs). The advantage of this extension is that it can handle both randomness and f...
200
click to vote
WAOA
2005
Springer
16 years 7 days ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...