1022 search results - page 188 / 205 » New models and algorithms for programmable networks |
96
Voted
ICANN
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This paper’s intention is to present a new approach for decomposing motion trajectories. The proposed algorithm is based on nonnegative matrix factorization, which is a...
120
Voted
FIRBPERF
2005
IEEE
15 years 6 months ago
2005
IEEE
The main motivation for applying capacity planning techniques to the design of Internet-based video services is that very often these systems incur significant delays that decrea...
97
Voted
GD
2005
Springer
15 years 6 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
ICANN
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
100
click to vote
TSMC
2002
15 years 1 days ago
2002
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...