2661 search results - page 195 / 533 » Quantum Complexity Classes |
162
Voted
TIP
2002
15 years 3 months ago
2002
An unsupervised classification algorithm is derived by modeling observed data as a mixture of several mutually exclusive classes that are each described by linear combinations of i...
121
Voted
WG
2010
Springer
15 years 1 months ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
157
Voted
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
Stochastic Flow Models (SFMs) are stochastic ystems that abstract the dynamics of complex discrete event systems involving the control of sharable resources. SFMs have been used to...
157
click to vote
ICIP
2008
IEEE
16 years 5 months ago
2008
IEEE
A richer set of land-cover classes are observable in satellite imagery than ever before due to the increased sub-meter resolution. Individual objects, such as cars and houses, are...
134
Voted
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...