Výsledky vyhľadávania - "Non Numerical Algorithms and Problems—Computations on Discrete Structures"

Jitter regulation for multiple streams

Autori: David Hay Gabriel Scalosub The Pennsylvania State University CiteSeerX Archives

Prispievatelia: David Hay Gabriel Scalosub The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.tlc-networks.polito.it/oldsite/hay/publications/jitter-journal.pdf.

Predmety: Categories and Subject Descriptors, C.2.1 [Computer-Communication Networks, Network Architecture and Design—Packet-Switching Network, Store and Forward Networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Non Numerical Algorithms and Problems—Computations on Discrete Structures, Sequencing and Scheduling General Terms, Algorithms, Design, Performance, Theory Additional Key Words and Phrases, Jitter Regulation, Buffer Management, Quality of Service, Buffer Overflow and Underflow, Scheduling, Online Algorithms, Competitive Analysis

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.323.7506
http://www.tlc-networks.polito.it/oldsite/hay/publications/jitter-journal.pdf

Hubs, authorities, and communities

Autori: Jon M. Kleinberg The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Jon M. Kleinberg The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.csee.umbc.edu/~kolari1/Mining/papers/ft_gateway.cfm.pdf.

Predmety: Categories and Subject Descriptors, H.5.4 [Information Interfaces and Presentation, Hypertext / Hypermedia, F.2.2 [Analysis of Algorithms and Problem Complexity, Non-numerical algorithms and problems- Computations on discrete structures General Terms, Algorithms, Human Factors. Additional Key Words and Phrases, Hypertext structure, World Wide Web, Link analysis, Graph algorithms

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.507.7890; http://www.csee.umbc.edu/~kolari1/Mining/papers/ft_gateway.cfm.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.507.7890
http://www.csee.umbc.edu/~kolari1/Mining/papers/ft_gateway.cfm.pdf

The MINIMUM BOUNDED DEGREE SPANNING TREE problem

Autori: Mohit Singh The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Mohit Singh The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.andrew.cmu.edu/user/mohits/mbdst.pdf.

Predmety: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Non Numerical Algorithms and Problems—Computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—Network Problems, Trees

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.9819; http://www.andrew.cmu.edu/user/mohits/mbdst.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.9819
http://www.andrew.cmu.edu/user/mohits/mbdst.pdf

APrivate and Continual Release of Statistics

Autori: T-h. Hubert Chan Hong Kong The Pennsylvania State University CiteSeerX Archives

Prispievatelia: T-h. Hubert Chan Hong Kong The Pennsylvania State University CiteSeerX Archives

Zdroj: https://eprint.iacr.org/2010/076.pdf.

Predmety: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Non- numerical Algorithms and Problems—Computations on discrete structures General Terms, Privacy, Algorithms Additional Key Words and Phrases, Differential privacy, continual mechanism, streaming algorithm

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.593.3387

Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal

Autori: Mohit Singh The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Mohit Singh The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cse.cuhk.edu.hk/~chi/papers/mbdst.pdf.

Predmety: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Non Numerical Algorithms and Problems—Computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—Network Problems, Trees. General Terms, Algorithms, Theory Additional Key Words and Phrases, Approximation algorithms, Spanning Trees, Bounded degree, Iterative rounding. ACM Reference Format

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.433.674; http://www.cse.cuhk.edu.hk/~chi/papers/mbdst.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.433.674
http://www.cse.cuhk.edu.hk/~chi/papers/mbdst.pdf

The Complexity of Temporal Constraint Satisfaction Problems.

Autori: BODIRSKY, MANUEL KÁRA, JAN

Zdroj: Journal of the ACM; Jan2010, Vol. 57 Issue 2, p9-9:41, 41p, 11 Diagrams, 4 Charts

Predmety: CONSTRAINT satisfaction, ARTIFICIAL intelligence, DIGITAL computer simulation, MACHINE theory, SIMULATION methods & models, MATHEMATICAL variables, MATHEMATICAL constants

Matching Algorithmic Bounds for Finding a Brouwer Fixed Point.

Autori: XI CHEN XIAOTIE DENG

Zdroj: Journal of the ACM; Jul2008, Vol. 55 Issue 3, p1-26, 26p, 1 Diagram, 8 Charts

Predmety: BOUNDARY value problems, ALGORITHMS, NONLINEAR boundary value problems, INITIAL value problems, COMPLEX variables, MATHEMATICAL physics, FIXED point theory, NONLINEAR operators

Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface.

Autori: De Verdière, Eacute;ric Colin Lazarus, Francis

Zdroj: Journal of the ACM; Jul2007, Vol. 54 Issue 4, p1-27, 27p, 3 Illustrations, 5 Diagrams

Predmety: MATHEMATICAL decomposition, OPTIMAL designs (Statistics), HOMOTOPY theory, ALGORITHMS, GRAPHIC methods, PROBABILITY theory

New Hardness Results for Congestion Minimization and Machine Scheduling.

Autori: Chuzhoy, Julia Naor, Joseph (Seffi)

Zdroj: Journal of the ACM; Sep2006, Vol. 53 Issue 5, p707-721, 15p

Predmety: COMPUTER networks, BOTTLENECKS (Manufacturing), COMPUTER scheduling, DIRECTED graphs, MATHEMATICAL analysis

Subexponential Parameterized Algorithms on Bounded-Genus Graphs and H-Minor-Free Graphs.

Autori: Demaine, Erik D. Fomin, Fedor V. Hajiaghayi, Mohammadtaghi a ďalší

Zdroj: Journal of the ACM; Nov2005, Vol. 52 Issue 6, p866-893, 28p

Predmety: ALGORITHMS, GRAPHIC methods, GRAPH theory, ALGEBRA, COMBINATORICS

Efficient Algorithms for the 2-Gathering Problem.

Autori: Shalita, Alon Zwick, Uri

Zdroj: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 2, p34:1-34:20, 20p, 5 Diagrams, 4 Charts

Predmety: ALGORITHMS, NUMERICAL analysis, GRAPH theory, BIPARTITE graphs, DIRECTED graphs, GRAPHIC methods

Shortest Paths in Directed Planar Graphs with Negative Lengths: A Linear-Space O(n log² n)-Time Algorithm.

Autori: Klein, Philip N. Mozes, Shay Weimann, Oren

Zdroj: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 2, p30:1-30:18, 18p, 7 Diagrams, 2 Charts

Predmety: PATHS & cycles in graph theory, COMBINATORICS, GRAPHIC methods, DIRECTED graphs, LINEAR algebra, ALGORITHMS

Time-Dependent Multi-Scheduling of Multicast.

Autori: Cohen, Rami Rawitz, Dror Raz, Danny

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 6 Issue 1, p14:1-14:22, 22p, 5 Diagrams, 2 Charts

Predmety: MULTICASTING (Computer networks), COMPUTER networks, DIGITAL communications, ELECTRONIC data processing, ELECTRONIC systems, DATA transmission systems

Approximating Connectivity Augmentation Problems.

Autori: Nutova, Zeev

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 6 Issue 1, p5:1-5:19, 19p

Predmety: APPROXIMATION theory, FUNCTIONAL analysis, ALGORITHMS, RATIO & proportion, POLYNOMIALS, ALGEBRA

A Better Approximation Ratio for the Vertex Cover Problem.

Autori: Karakostas, George

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 5 Issue 4, p41-41:8, 8p

Predmety: POLYNOMIALS, FINANCIAL ratios, EQUALITY, ALGEBRA, ALGORITHMS, NETWORK analysis (Planning), APPROXIMATION theory, BIVECTORS

Enumeration of Isolated Cliques and Pseudo-Cliques.

Autori: Ito, Hiro Iwama, Kazuo

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 5 Issue 4, p40-40:21, 21p, 7 Diagrams

Predmety: STATISTICAL decision making, COMBINATORIAL enumeration problems, TIMEOUT method, SOCIAL networks, ALGOL (Computer program language), CHEMICAL elements, ESTIMATION theory, AUTOMATIC theorem proving

Approximating the Distance to Properties in Bounded-Degree and General Sparse Graphs.

Autori: MARKO, SHARON RON, DANA

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 5 Issue 2, p22-22:28, 28p, 9 Black and White Photographs, 2 Diagrams

Predmety: GRAPHIC methods, ALGORITHMS, EULERIAN graphs, COMPUTATIONAL complexity, MACHINE theory

Combinatorial Bounds via Measure and Conquer: Bounding Minimal Dominating Sets and Applications.

Autori: Fomin, Fedor V. Grandoni, Fabrizio Pyatkin, Artem V. a ďalší

Zdroj: ACM Transactions on Algorithms; 2008, Vol. 5 Issue 1, p9-9:17, 17p, 1 Chart

Predmety: GRAPH theory, COMBINATORICS, MATHEMATICAL analysis, COMPUTATIONAL mathematics, GRAPH algorithms, ALGORITHMS

On Hard Instances of Approximate Vertex Cover.

Autori: Vishwanathan, Sundar

Zdroj: ACM Transactions on Algorithms; 2008, Vol. 5 Issue 1, p7-7:6, 6p

Predmety: VERTEX operator algebras, OPERATOR theory, FUNCTIONAL analysis, APPROXIMATION theory, MATHEMATICAL functions, ALGORITHMS

Deterministic Conflict-Free Coloring for Intervals: From Offline to Online.

Autori: Bar-Noy, Amotz Cheilaris, Panagiotis Smorodinsky, Shakhar

Zdroj: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 4, p44-44.18, 18p, 5 Diagrams, 3 Charts

Predmety: ALGORITHMS, COMPUTER programming, HYPERGRAPHS, GRAPH theory, CHARTS, diagrams, etc.