Sökning: "Danupon Na Nongkai"

Hittade 2 avhandlingar innehållade orden Danupon Na Nongkai.

1. 1. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization

   Författare :Jan van den Brand; Danupon Na Nongkai; Santosh Vempala; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Dynamic Algorithm; Data Structure; Optimization; Linear Program; Bipartite Matching; Shortest Path; Maximum Flow; Minimum Cost Flow; Diameter; Computer Science; Datalogi;

   Sammanfattning : Dynamic algorithms are used to efficiently maintain solutions to problems where the input undergoes some changes.This thesis studies dynamic algorithms that maintain solutions to linear algebra problems and we explore their applications and implications for dynamic graphs and optimization problems. LÄS MER

3. 2. Optimization beyond a single submodular function : Submodular optimization for ranking, decision trees and diversity

   Författare :Guangyi Zhang; Aristides Gionis; Danupon Na Nongkai; Parinya Chalermsook; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Submodular optimization; Approximation algorithms; Ranking; Decision trees; Diversity; Datalogi; Computer Science;

   Sammanfattning : Submodular functions characterize mathematically the ubiquitous ``diminishing-returns'’ property. They are widely used to describe core subjects in numerous applications, including economic utility, redundancy in information, spread of influence in social networks, and more. LÄS MER