2446 search results - page 136 / 490 » Characterizing the Performance of |
172
Voted
AAAI
2006
15 years 8 months ago
2006
Several researchers have illustrated that constraints can improve the results of a variety of clustering algorithms. However, there can be a large variation in this improvement, e...
173
click to vote
NETWORKING
2004
15 years 8 months ago
2004
Abstract. Relaying can improve performance of a wireless network, especially when different transmission modes with distance/cost tradeoffs are available. Examples of such modes in...
184
click to vote
NIPS
2001
15 years 8 months ago
2001
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
107
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the c...
186
click to vote
PRL
2006
15 years 6 months ago
2006
In this paper, a multi-class feature selection scheme based on recursive feature elimination (RFE) is proposed for texture classifications. The feature selection scheme is perform...