Sciweavers

2520 search results - page 54 / 504
» The complexity of approximating entropy
Sort
View
ACL
2006
14 years 11 months ago
Morphological Richness Offsets Resource Demand - Experiences in Constructing a POS Tagger for Hindi
In this paper we report our work on building a POS tagger for a morphologically rich language- Hindi. The theme of the research is to vindicate the stand that- if morphology is st...
Smriti Singh, Kuhoo Gupta, Manish Shrivastava, Pus...
JMIV
2006
185views more  JMIV 2006»
14 years 10 months ago
Intrinsic Statistics on Riemannian Manifolds: Basic Tools for Geometric Measurements
In medical image analysis and high level computer vision, there is an intensive use of geometric features like orientations, lines, and geometric transformations ranging from simp...
Xavier Pennec
ICPR
2008
IEEE
15 years 11 months ago
Motion estimation approach based on dual-tree complex wavelets
The loss of information due to occlusion and other complications has been one of the main bottlenecks in the field of motion estimation. In this paper, we propose a novel motion e...
Changzhu Wu, Hongxiao Wang, Qing Wang
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
15 years 4 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
COCOON
2005
Springer
15 years 3 months ago
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
Jinsong Tan, Kok Seng Chua, Louxin Zhang