815 search results - page 77 / 163 » Approximate Entropy Reducts |
MOC
1998
14 years 11 months ago
1998
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptio...
133
click to vote
COCOON
2010
Springer
14 years 10 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
123
click to vote
STOC
2009
ACM
16 years 15 days ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. There has been growing interest in developing nonlinear dimensionality reduction algorithms for vision applications. Although progress has been made in recent years, conv...