Sciweavers

2142 search results - page 88 / 429
» Hierarchical Adaptive Clustering
Sort
View
ICDAR
2009
IEEE
14 years 2 months ago
Unsupervised HMM Adaptation Using Page Style Clustering
In this paper we present an innovative two-stage adaptation approach for handwriting recognition that is based on clustering of similar pages in the training data. In our approach...
Huaigu Cao, Rohit Prasad, Shirin Saleem, Premkumar...
ICPR
2008
IEEE
14 years 2 months ago
Adaptive selection of non-target cluster centers for K-means tracker
Hua et al. have proposed a stable and efficient tracking algorithm called “K-means tracker”[2, 3, 5]. This paper describes an adaptive non-target cluster center selection met...
Hiroshi Oike, Haiyuan Wu, Toshikazu Wada
SIGIR
2004
ACM
14 years 1 months ago
Document clustering via adaptive subspace iteration
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
Tao Li, Sheng Ma, Mitsunori Ogihara
ICCAD
1994
IEEE
101views Hardware» more  ICCAD 1994»
14 years 1 days ago
A general framework for vertex orderings, with applications to netlist clustering
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
Charles J. Alpert, Andrew B. Kahng
TON
2008
109views more  TON 2008»
13 years 7 months ago
On hierarchical traffic grooming in WDM networks
Abstract--The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any ...
Bensong Chen, George N. Rouskas, Rudra Dutta