Sciweavers

817 search results - page 5 / 164
» On 2-factors with k components
Sort
View
ESA
2006
Springer
103views Algorithms» more  ESA 2006»
14 years 6 days ago
Greedy in Approximation Algorithms
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
Julián Mestre
ANTS
2008
Springer
106views Algorithms» more  ANTS 2008»
13 years 10 months ago
Computing in Component Groups of Elliptic Curves
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
J. E. Cremona
COLING
2010
13 years 3 months ago
Tibetan Number Identification Based on Classification of Number Components in Tibetan Word Segmentation
Tibetan word segmentation is essential for Tibetan information processing. People mainly use the basic machine matching method which is based on dictionary to segment Tibetan word...
Huidan Liu, Weina Zhao, Minghua Nuo, Li Jiang, Jia...