Sciweavers

8431 search results - page 55 / 1687
» Algorithmically Independent Sequences
Sort
View
NAACL
2007
14 years 11 months ago
High-Performance, Language-Independent Morphological Segmentation
This paper introduces an unsupervised morphological segmentation algorithm that shows robust performance for four languages with different levels of morphological complexity. In p...
Sajib Dasgupta, Vincent Ng
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
15 years 3 months ago
Derandomized Constructions of k-Wise (Almost) Independent Permutations
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
Eyal Kaplan, Moni Naor, Omer Reingold
CCCG
2010
14 years 11 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
PR
2006
95views more  PR 2006»
14 years 9 months ago
Subspace independent component analysis using vector kurtosis
This discussion presents a new perspective of subspace independent component analysis (ICA). The notion of a function of cumulants (kurtosis) is generalized to vector kurtosis. Th...
Alok Sharma, Kuldip K. Paliwal
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
15 years 3 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz