720 search results - page 83 / 144 » Linear k-arboricities on trees |
183
click to vote
ICCPOL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We propose a lexicalized syntactic reordering framework for crosslanguage word aligning and translating researches. In this framework, we first flatten hierarchical sourc...
201
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
179
click to vote
IPPS
2006
IEEE
16 years 25 days ago
2006
IEEE
This paper describes a parallel implementation of our recently developed algorithm for phylogenetic analysis on the IBM BlueGene/L cluster [15]. This algorithm constructs evolutio...
167
click to vote
GD
2005
Springer
16 years 10 days 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 ...
155
click to vote
ICDM
2003
IEEE
16 years 2 days ago
2003
IEEE
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...