Suchergebnisse - "Theory Keywords Approximation algorithms"

Coresets for Polytope Distance

Autoren: Bernd Gärtner Martin Jaggi The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Bernd Gärtner Martin Jaggi The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.m8j.net/data/List/Files-143/Coresets%20for%20Polytope%20Distance%20-%20Martins%20Version.pdf.

Schlagwörter: problems and computations, Pattern matching, I.5.1 [Pattern Recognition, Models—Geometric General Terms Algorithms, Theory Keywords Approximation Algorithms, Coresets, Polytope Distance, Support Vector Machines, Kernel Methods, Sparsity, Geometric Optimization

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.3011

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.3011
http://www.m8j.net/data/List/Files-143/Coresets%20for%20Polytope%20Distance%20-%20Martins%20Version.pdf

Packing to angles and sectors

Autoren: Piotr Berman Jieun Jeong Shiva Prasad Kasiviswanathan et al.

Weitere Verfasser: Piotr Berman Jieun Jeong Shiva Prasad Kasiviswanathan et al.

Quelle: http://ce.sharif.ac.ir/~ghodsi/archive/d-papers/SPAA/2007/Packing to Angles and Sectors.pdf.

Schlagwörter: F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms Algorithms, Theory Keywords Approximation Algorithms, Bin Packing, Directional Antenna, Geometric Covering

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.390.8258

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.390.8258
http://ce.sharif.ac.ir/~ghodsi/archive/d-papers/SPAA/2007/Packing to Angles and Sectors.pdf

Maximizing influence in a competitive social network: a follower’s perspective

Autoren: Tim Carnes Rashekhar Nagarajan Stefan M. Wild et al.

Weitere Verfasser: Tim Carnes Rashekhar Nagarajan Stefan M. Wild et al.

Quelle: http://itcs.tsinghua.edu.cn/%7Eanke/ICEC22.pdf.

Schlagwörter: General Terms Algorithms, Performance, Theory Keywords Approximation Algorithms, Social Networks, Viral Marketing, Network Analysis, Targeted Marketing Research supported by NSF grants CCR-0635121 &, DMI-0500263

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.9366; http://itcs.tsinghua.edu.cn/%7Eanke/ICEC22.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.9366
http://itcs.tsinghua.edu.cn/%7Eanke/ICEC22.pdf

Packing to Angles and Sectors

Autoren: Piotr Berman Jieun Jeong Shiva Prasad Kasiviswanathan et al.

Weitere Verfasser: Piotr Berman Jieun Jeong Shiva Prasad Kasiviswanathan et al.

Quelle: http://www.cse.psu.edu/~bhuvan/papers/ps/spaa40-berm.pdf.

Schlagwörter: Algorithms, Theory Keywords Approximation Algorithms, Directional Antenna, Geometric Covering, Capacitated Set Covering

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.7590

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.7590
http://www.cse.psu.edu/~bhuvan/papers/ps/spaa40-berm.pdf

Constant factor approximation of vertex-cuts in planar graphs

Autoren: Eyal Amir Robert Krauthgamer Satish Rao et al.

Weitere Verfasser: Eyal Amir Robert Krauthgamer Satish Rao et al.

Quelle: http://www.cs.berkeley.edu/~satishr/AKR-PlanarSeparator-STOC03.ps.gz.

Schlagwörter: General Terms Algorithms, Theory Keywords Approximation algorithms, balanced cut, planar graph, planar separator, quotient cut, vertex separator

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.4313

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.4313
http://www.cs.berkeley.edu/~satishr/AKR-PlanarSeparator-STOC03.ps.gz

Constant factor approximation of vertex-cuts in planar graphs (Extended Abstract)

Autoren: Eyal Amir Robert Krauthgamer Satish Rao et al.

Weitere Verfasser: Eyal Amir Robert Krauthgamer Satish Rao et al.

Quelle: http://www.wisdom.weizmann.ac.il/~robi/papers/AKR-PlanarSeparator-STOC03.pdf.

Schlagwörter: Algorithms, Theory Keywords Approximation algorithms, balanced cut, planar graph, planar separator, quotient cut, vertex separator

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.1401

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.1401
http://www.wisdom.weizmann.ac.il/~robi/papers/AKR-PlanarSeparator-STOC03.pdf

A Polynomial-Time Approximation Scheme for Base Station Positioning in UMTS Networks

Autoren: Matthias Galota Christian Glaßer Steffen Reith et al.

Weitere Verfasser: Matthias Galota Christian Glaßer Steffen Reith et al.

Quelle: ftp://ftp-info4.informatik.uni-wuerzburg.de/pub/TRs/tr264.ps.gz

Schlagwörter: Algorithms, Design, Theory Keywords Approximation Algorithms, Network Design

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.7444

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.7444

Coresets for polytope distance

Autoren: Bernd Gärtner Martin Jaggi The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Bernd Gärtner Martin Jaggi The Pennsylvania State University CiteSeerX Archives

Quelle: http://delivery.acm.org/10.1145/1550000/1542370/p33-gartner.pdf?CFID%3D285707620%26CFTOKEN%3D20203871%26__acm__%3D1362046528_1fbfb90b3d98796925837087b455f23c%26acc%3DACTIVE+SERVICE%26ip%3D130.203.136.92.

Schlagwörter: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Geometrical problems and computations, Pattern matching, I.5.1 [Pattern Recognition, Models—Geometric General Terms Algorithms, Theory Keywords Approximation Algorithms, Coresets, Polytope Distance, Support Vector Machines, Kernel Methods, Sparsity, Geometric Optimization

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.8692

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.8692
https://doi.org/10.1145/1550000/1542370/p33-gartner.pdf?CFID%3D285707620%26CFTOKEN%3D20203871%26__acm__%3D1362046528_1fbfb90b3d98796925837087b455f23c%26acc%3DACTIVE+SERVICE%26ip%3D130.203.136.92

Optimizing Budget Allocation Among Channels and Influencers

Autoren: Noga Alon Iftah Gamzu Moshe Tennenholtz et al.

Weitere Verfasser: Noga Alon Iftah Gamzu Moshe Tennenholtz et al.

Quelle: http://www2012.wwwconference.org/proceedings/proceedings/p381.pdf.

Schlagwörter: Algorithms, Economics, Theory Keywords Approximation algorithms

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.7207; http://www2012.wwwconference.org/proceedings/proceedings/p381.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.7207
http://www2012.wwwconference.org/proceedings/proceedings/p381.pdf

Approximating Pure Nash Equilibrium in Cut, Party Affiliation, and Satisfiability Games

Autoren: Anand Bhalgat Tanmoy Chakraborty Sanjeev Khanna et al.

Weitere Verfasser: Anand Bhalgat Tanmoy Chakraborty Sanjeev Khanna et al.

Quelle: http://www.seas.upenn.edu/%7Etanmoy/papers/BCK10.pdf.

Schlagwörter: Algorithms, Economics, Theory Keywords Approximation algorithms, Pure Nash equilibrium, Cut Games, Party Affiliation Games, Potential Games

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.1298; http://www.seas.upenn.edu/%7Etanmoy/papers/BCK10.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.1298
http://www.seas.upenn.edu/%7Etanmoy/papers/BCK10.pdf