Výsledky vyhledávání - Nonnumerical Algorithms and Problems General Terms Theory

General Techniques for Analyzing Recursive Algorithms with Applications: General techniques for analyzing recursive algorithms with applications

Autoři: Rakesh M. Verma

Zdroj: SIAM Journal on Computing. 26:568-581

Témata: graph algorithms, recurrences, problem complexity, Analysis of algorithms and problem complexity, Pattern recognition, speech recognition, 0102 computer and information sciences, 01 natural sciences, analysis of algorithms, Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.), associative-commutative (AC) matching, Graph theory (including graph drawing) in computer science, subtree isomorphism, Recurrences, divide-and-conquer, 0101 mathematics

Popis souboru: application/xml

On obstruction-free transactions

Autoři: Rachid Guerraoui Michał Kapałka The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Rachid Guerraoui Michał Kapałka The Pennsylvania State University CiteSeerX Archives

Zdroj: http://infoscience.epfl.ch/record/120526/files/fp097-guerraoui.pdf.

Témata: F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms Theory, Algorithms Keywords Transactional memory, obstruction-freedom, consensus number

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.2957
http://infoscience.epfl.ch/record/120526/files/fp097-guerraoui.pdf

Wherefore Art Thou R3579X? Anonymized Social Networks, Hidden Patterns, and Structural Steganography

Autoři: Lars Backstrom Cynthia Dwork Jon Kleinberg a další

Přispěvatelé: Lars Backstrom Cynthia Dwork Jon Kleinberg a další

Zdroj: http://cs-people.bu.edu/evimaria/cs591/steganography.pdf.

Témata: F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms Theory, Measurement Keywords social networks, anonymization

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.7193
http://cs-people.bu.edu/evimaria/cs591/steganography.pdf

Polylogarithmic Concurrent Data Structures from Monotone Circuits.

Autoři: ASPNES, JAMES ATTIYA, HAGIT CENSOR-HILLEL, KEREN

Zdroj: Journal of the ACM; Feb2012, Vol. 59 Issue 1, p2-2:24, 24p

Témata: DATA structures, LOGARITHMIC functions, COMPUTER circuits, COMPUTATIONAL complexity, ALGORITHMS, COMPUTER programming, MACHINE theory

ABSTRACT An Ω(n log n) Lower Bound on the Cost of Mutual Exclusion

Autoři: Rui Fan The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Rui Fan The Pennsylvania State University CiteSeerX Archives

Zdroj: http://theory.csail.mit.edu/tds/papers/Fan/podc06.pdf.

Témata: F.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms Theory, Algorithms Keywords Mutual exclusion, Time complexity, Lower bound techniques

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.1189; http://theory.csail.mit.edu/tds/papers/Fan/podc06.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.1189
http://theory.csail.mit.edu/tds/papers/Fan/podc06.pdf

Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields

Autoři: Jon Kleinberg Éva Tardos The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Jon Kleinberg Éva Tardos The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.cornell.edu/home/kleinber/focs99-mrf.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.538
http://www.cs.cornell.edu/home/kleinber/focs99-mrf.pdf

Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems General Terms Algorithms, Theory

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.uwaterloo.ca/~tmchan/moreapsp_stoc.ps.

Témata: graph algorithms, computational geometry, matrix multiplication

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.8779; http://www.cs.uwaterloo.ca/~tmchan/moreapsp_stoc.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.8779
http://www.cs.uwaterloo.ca/~tmchan/moreapsp_stoc.ps

Prize-Collecting Steiner Network Problems

Autoři: MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov The Pennsylvania State University CiteSeerX Archives

Zdroj: http://crab.rutgers.edu/~guyk/pub/pc/nabs.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory Additional Key Words and Phrases, Steiner network problem, prize-collecting, edge-connectivity, vertexconnectivity, all-or-nothing flows ACM Reference Format

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.3699; http://crab.rutgers.edu/~guyk/pub/pc/nabs.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.3699
http://crab.rutgers.edu/~guyk/pub/pc/nabs.pdf

To fill or not to fill: the gas station problem

Autoři: Samir Khuller The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Samir Khuller The Pennsylvania State University CiteSeerX Archives

Zdroj: http://sydney.edu.au/engineering/it/~mestre/papers/gas-station.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complex- ity, Nonnumerical Algorithms and Problems General Terms, Graph Theory, Algorithms Additional Key Words and Phrases, Approximation Algorithms, Shortest Paths, Vehicle Routing

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.597.9884
http://sydney.edu.au/engineering/it/~mestre/papers/gas-station.pdf

D.: Algorithms for subset selection in linear regression

Autoři: Abhimanyu Das David Kempe The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Abhimanyu Das David Kempe The Pennsylvania State University CiteSeerX Archives

Zdroj: http://pollux.usc.edu/~abhimand/regression.pdf.

Témata: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complex- ity, Nonnumerical Algorithms and Problems General Terms Algorithms, Theory

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.530.6299; http://pollux.usc.edu/~abhimand/regression.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.530.6299
http://pollux.usc.edu/~abhimand/regression.pdf

Unification: a multidisciplinary survey: Unification: A multidisciplinary survey

Autoři: Kevin Knight

Zdroj: ACM Computing Surveys. 21:93-124

Témata: Artificial intelligence, Data structures, algebraic manipulation, type inference, unification, Analysis of algorithms and problem complexity, higher order logic, occur check, 0102 computer and information sciences, 02 engineering and technology, computations on discrete structures, 01 natural sciences, logic programming, theorem proving, infinite terms, 0202 electrical engineering, electronic engineering, information engineering, inheritance, natural language processing, analysis of algorithms and problem complexity, nonnumerical algorithms and problems, generalization, graphs, computational complexity, Natural language processing, resolution, parallel algorithms, artificial intelligence, prolog, pattern matching, lattices, equational theories, Theorem proving (deduction, resolution, etc.)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/4110162
https://doi.org/10.1145/62029.62030
http://www.cse.buffalo.edu/~rapaport/675w/p93-knight.pdf
https://core.ac.uk/display/24451474
http://portal.acm.org/citation.cfm?id=62030
https://www.isi.edu/natural-language/people/unification-knight.pdf
https://dblp.uni-trier.de/db/journals/csur/csur21.html#Knight89
https://dl.acm.org/doi/pdf/10.1145/62029.62030

Algorithms for distributed functional monitoring

Autoři: Graham Cormode S. Muthukrishnan Ke Yi a další

Přispěvatelé: Graham Cormode S. Muthukrishnan Ke Yi a další

Zdroj: http://www.research.att.com/people/Cormode_Graham/library/publications/CormodeMuthukrishnanYi11.pdf.

Témata: Categories and Subject Descriptors, F.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms, Algorithms, theory Additional Key Words and Phrases, Distributed computing, functional monitoring

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.829; http://www.research.att.com/people/Cormode_Graham/library/publications/CormodeMuthukrishnanYi11.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.829
http://www.research.att.com/people/Cormode_Graham/library/publications/CormodeMuthukrishnanYi11.pdf

Online Auctions and Generalized Secretary Problems. SIGecom Exchange 7

Autoři: Moshe Babaioff Nicole Immorlica David Kempe a další

Přispěvatelé: Moshe Babaioff Nicole Immorlica David Kempe a další

Zdroj: http://www-rcf.usc.edu/~dkempe/publications/secretarySIG.pdf.

Témata: Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms, Algorithms, Economics, Theory Additional Key Words and Phrases, Online Algorithms, Secretary Problems, Auctions, Knapsack, Matroids

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.7718
http://www-rcf.usc.edu/~dkempe/publications/secretarySIG.pdf

A measure & conquer approach for the analysis of exact algorithms

Autoři: Fedor V. Fomin Fabrizio Grandoni Dieter Kratsch a další

Přispěvatelé: Fedor V. Fomin Fabrizio Grandoni Dieter Kratsch a další

Zdroj: http://lita.sciences.univ-metz.fr/~kratsch/publications/measureandconquer.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory Additional Key Words and Phrases, Dominating set, exact algorithm, independent set

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.9323
http://lita.sciences.univ-metz.fr/~kratsch/publications/measureandconquer.pdf

Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems General Terms Algorithms, Theory

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://distcomp.ethz.ch/publications/dialm05a.ps.

Témata: routing, mobile network, dynamic graphs

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.4183; http://distcomp.ethz.ch/publications/dialm05a.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.4183
http://distcomp.ethz.ch/publications/dialm05a.ps

A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

Autoři: Guy Even Jon Feldman Guy Kortsarz a další

Přispěvatelé: Guy Even Jon Feldman Guy Kortsarz a další

Zdroj: http://crab.rutgers.edu/~guyk/pub/tap1/journal.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms, Theory Additional Key Words and Phrases, Approximation algorithms, Connectivity, Graphs

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.412.422; http://crab.rutgers.edu/~guyk/pub/tap1/journal.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.412.422
http://crab.rutgers.edu/~guyk/pub/tap1/journal.pdf

Categories and Subject Descriptors [F.2.2]: Nonnumerical Algorithms and Problems General Terms Algorithms, Theory

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.nada.kth.se/~johanh/jh2csp.ps.

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.4654; http://www.nada.kth.se/~johanh/jh2csp.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.4654
http://www.nada.kth.se/~johanh/jh2csp.ps

Nonnumerical Algorithms and Problems General Terms Algorithms, Theory

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.distcomp.ethz.ch/publications/dialm05a.pdf.

Témata: routing, mobile network, dynamic graphs

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.9978; http://www.distcomp.ethz.ch/publications/dialm05a.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.9978
http://www.distcomp.ethz.ch/publications/dialm05a.pdf

Efficient Algorithms for Bichromatic Separability

Autoři: Pankaj K. Agarwal Boris Aronov Vladlen Koltun a další

Přispěvatelé: Pankaj K. Agarwal Boris Aronov Vladlen Koltun a další

Zdroj: http://biogeometry.duke.edu/pubs-pankaj/papers/bi-sep.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory Additional Key Words and Phrases, Geometric algorithms, separability, arrangements

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.6821
http://biogeometry.duke.edu/pubs-pankaj/papers/bi-sep.pdf

An Õ(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

Autoři: Bhalgat Ramesh Hariharan Telikepalli Kavitha Debmalya Panigrahi a další

Přispěvatelé: Bhalgat Ramesh Hariharan Telikepalli Kavitha Debmalya Panigrahi a další

Zdroj: http://people.csail.mit.edu/debmalya/papers/stoc07-ghtree.pdf.

Témata: Categories and Subject Descriptors, F.2.2[Theory of Computation, Nonnumerical Algorithms and Problems General Terms, Algorithms

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.4293
http://people.csail.mit.edu/debmalya/papers/stoc07-ghtree.pdf