Amanote Research

Amanote Research

    RegisterSign In

Disjoint Segments With Maximum Density

Lecture Notes in Computer Science - Germany
doi 10.1007/11428848_108
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2005

Authors
Yen Hung ChenHsueh-I LuChuan Yi Tang
Publisher

Springer Berlin Heidelberg


Related search

A Blossom Algorithm for Maximum Edge-Disjoint T-Paths

2020English

Finding Maximum Margin Segments in Speech

2007English

On the Tricyclic Graphs With Three Disjoint 6-Cycles and Maximum Matching Energy

Tamkang Journal of Mathematics
Materials ScienceApplied MathematicsAlloysMetalsMathematics
2015English

Disjoint Set Union With Randomized Linking

2013English

129. CT-angiography Using Maximum Density Projectoin

Nippon Hoshasen Gijutsu Gakkai zasshi
Medicine
1993English

Maximum Entropy Gibbs Density Modeling for Pattern Classification

Entropy
Electronic EngineeringInformation SystemsMathematical PhysicsElectricalAstronomyPhysics
2012English

Disjoint DNF Tautologies With Conflict Bound Two

Journal on Satisfiability, Boolean Modeling and Computation
2007English

Electron Density Distribution by the Maximum Entropy Method.

Nihon Kessho Gakkaishi
1990English

Fast Nonparametric Maximum Likelihood Density Deconvolution Using Bernstein Polynomial

Statistica Sinica
UncertaintyStatisticsProbability
2021English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy