Sciweavers

720 search results - page 83 / 144
» Linear k-arboricities on trees
Sort
View
ICCPOL
2009
Springer
14 years 3 months ago
Lexicalized Syntactic Reordering Framework for Word Alignment and Machine Translation
Abstract. We propose a lexicalized syntactic reordering framework for crosslanguage word aligning and translating researches. In this framework, we first flatten hierarchical sourc...
Chung-Chi Huang, Wei-Teh Chen, Jason S. Chang
GLOBECOM
2007
IEEE
14 years 3 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— 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...
Luay Azzam, Ender Ayanoglu
IPPS
2006
IEEE
14 years 2 months ago
Parallel implementation of a quartet-based algorithm for phylogenetic analysis
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...
Bing Bing Zhou, Daniel Chu, Monther Tarawneh, Ping...
GD
2005
Springer
14 years 2 months ago
Drawing Clustered Graphs in Three Dimensions
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 ...
Joshua Wing Kei Ho, Seok-Hee Hong
ICDM
2003
IEEE
71views Data Mining» more  ICDM 2003»
14 years 2 months ago
Tree-structured Partitioning Based on Splitting Histograms of Distances
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...
Longin Jan Latecki, Rajagopal Venugopal, Marc Sobe...