Výsledky vyhledávání - Nonnumerical Algorithms and Problems— computations on discrete structures*
-
1
Autoři:
Přispěvatelé:
Témata: F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, H.2.8 [Database Management, Database Applications—Data mining, I.5.3 [Pattern Recognition, Clustering—Algorithms. Avainsanat — Nyckelord — Keywords Discrete basis, k-medians, SVD, PCA, database tiling, data mining, bicliques. Säilytyspaikka — Förvari
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.2454; http://www.cs.helsinki.fi/u/pamietti/data/papers/gradu.pdf
-
2
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, G.2.2 [Discrete Mathematics, Graph Theory—Graph labeling, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Design, Experimentation Additional Key Words and Phrases, Approximation algorithms, graph labeling
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.364.4836; http://www.dcc.unicamp.br/~fkm/publication/jea05.pdf
-
3
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Theory Additional Key Words and Phrases, Exponential-time algorithm, exact algorithm, constraint satisfaction, discrete optimization, partition function, generating function
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.7666; http://people.maths.ox.ac.uk/~scott/Papers/counting.pdf
-
4
Přispěvatelé: The Pennsylvania State University CiteSeerX Archives
Témata: General Terms, Algorithms, Experimentation, Theory Additional Key Words and Phrases, Approximation algorithms, average case analysis, bin packing
Popis souboru: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.1258; http://www.research.att.com/~dsj/papers/sumsqj.ps
-
5
Autoři:
Zdroj: ACM transactions on the web 3 (2009). doi:10.1145/1513876.1513879
info:cnr-pdr/source/autori:Dourisboure Y.; Geraci F.; Pellegrini M./titolo:Extraction and classification of dense implicit communities in the Web Graph/doi:10.1145%2F1513876.1513879/rivista:ACM transactions on the web/anno:2009/pagina_da:/pagina_a:/intervallo_pagine:/volume:3Témata: communities, H.2.8 Database applications. Clustering, web graph, detection of dense subgraph, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, F.2.2 Nonnumerical Algorithms and Problems. Computations on discrete structures
Přístupová URL adresa: http://wwwold.iit.cnr.it/staff/marco.pellegrini/papiri/jv-cybercom-draft2.pdf
https://dl.acm.org/doi/10.1145/1513876.1513879
https://dblp.uni-trier.de/db/journals/tweb/tweb3.html#DourisboureGP09
https://doi.org/10.1145/1513876.1513879
http://wwwold.iit.cnr.it/staff/marco.pellegrini/papiri/jv-cybercom-draft2.pdf
https://hdl.handle.net/20.500.14243/46197
https://doi.org/10.1145/1513876.1513879 -
6
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Theory Additional Key Words and Phrases, Kernelization, Lower Bounds, Max-Leaf Spanning Tree, Out-Branching, Parameterized Algorithms ACM Reference Format
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.7957; http://www.ii.uib.no/~daniello/papers/kernelsNoKernel.pdf
-
7
Autoři: a další
Přispěvatelé: a další
Zdroj: Lecture Notes in Computer Science ISBN: 9783319492582
Témata: [INFO.INFO-DC]Computer Science [cs]/Distributed, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.5: Reliability/D.4.5.2: Fault-tolerance, Parallel, 01 natural sciences, and Cluster Computing [cs.DC], ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, [INFO]Computer Science [cs], ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs/F.3.1.3: Mechanical verification, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.3: Studies of Program Constructs/F.3.3.4: Type structure
Popis souboru: application/pdf
Přístupová URL adresa: https://link.springer.com/article/10.1007/s00224-017-9828-z
https://hal.archives-ouvertes.fr/hal-01894618
https://doi.org/10.1007/s00224-017-9828-z
https://dblp.uni-trier.de/db/journals/mst/mst63.html#BalabonskiDRTU19
https://rd.springer.com/chapter/10.1007/978-3-319-49259-9_2
https://doi.org/10.1007/978-3-319-49259-9_2
https://hal.archives-ouvertes.fr/hal-01491813
https://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://link.springer.com/chapter/10.1007/978-3-319-49259-9_2
http://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://hal.science/hal-01894618v1/document
https://doi.org/10.1007/s00224-017-9828-z
https://hal.science/hal-01894618v1
https://hal.sorbonne-universite.fr/hal-01491813v1
https://doi.org/10.1007/978-3-319-49259-9_2 -
8
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, E.1 [Data Structures, Graphs and Networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—Graph algorithms General Terms, Algorithms, Experimentation, Theory Additional Key Words and Phrases, Dynamic graph algorithms, topological sort
Popis souboru: application/pdf
-
9
Autoři:
Zdroj: Algorithmica. 57:187-206
Témata: combinatorial algorithms, matroid intersection, randomized search heuristics, 0102 computer and information sciences, 02 engineering and technology, computations on discrete structures, 01 natural sciences, minimum weight basis, 0202 electrical engineering, electronic engineering, information engineering, ddc:510, evolutionary algorithms, nonnumerical algorithms and problems, matroids
Popis souboru: application/pdf; application/octet-stream
Přístupová URL adresa: http://www.joachim-reichel.de/publications/matroid-tr2.pdf
https://dl.acm.org/doi/10.1145/1276958.1277149
http://eldorado.tu-dortmund.de/handle/2003/26132
http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p947.pdf
https://dblp.uni-trier.de/db/conf/gecco/gecco2007.html#ReichelS07
http://www.joachim-reichel.de/publications/matroid-gecco07.pdf
https://core.ac.uk/display/24723544
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica57.html#ReichelS10
https://link.springer.com/10.1007/s00453-008-9253-4
https://link.springer.com/article/10.1007%2Fs00453-008-9253-4
https://dl.acm.org/doi/10.5555/3118215.3118265
http://hdl.handle.net/2003/26132
https://depositonce.tu-berlin.de/handle/11303/15635 -
10
Autoři:
Přispěvatelé:
Témata: Combinatorial Optimisation, Graph Algorithms, Approximation Algorithms, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.8615; http://arxiv.org/pdf/cs/0604020v2.pdf
-
11
Autoři: a další
Přispěvatelé: a další
Zdroj: Formal Methods in System Design. 35:190-225
Témata: ACM: C.: Computer Systems Organization/C.4: PERFORMANCE OF SYSTEMS/C.4.1: Fault tolerance, [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], 0209 industrial biotechnology, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, [INFO.INFO-PF] Computer Science [cs]/Performance [cs.PF], ACM: C.: Computer Systems Organization/C.3: SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS/C.3.2: Real-time and embedded systems, 0202 electrical engineering, electronic engineering, information engineering, distributed, and parallel languages, 02 engineering and technology, ACM: D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.2: Language Classifications/D.3.2.1: Concurrent
Popis souboru: application/pdf
-
12
Autoři: a další
Přispěvatelé: a další
Zdroj: Lecture Notes in Computer Science ISBN: 9783319096971
Témata: ddc:004, Data processing Computer science, Models of Computation (F.4.1), Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), Classes defined by grammars or automata (e.g., context-free languages, regular sets, recursive sets), 0102 computer and information sciences, 02 engineering and technology, Routing and layout, 01 natural sciences, Classes defined by resource-bounded automata, Algebraic language theory, Self-modifying machines (e.g., neural networks), Relations among complexity classes, 0202 electrical engineering, electronic engineering, information engineering, Decision problems, Pattern matching, Complexity of proof procedures, Bounded-action devices (e.g., Turing machines, random access machines), Machine-independent complexity, computational complexity, Automata (e.g., finite, push-down, resource-bounded), Formal Languages (D.3.1), almost-equivalence, 4. Education, Relations between models, hyper-minimization, Computability theory, 16. Peace & justice, Reducibility and completeness, Geometrical problems and computations, Relations among complexity measures, Operations on languages, Computations on discrete structures, Sorting and searching, Sequencing and scheduling, biautomata, Complexity hierarchies, Complexity Measures and Classes (F.2) (REVISED), Nonnumerical Algorithms and Problems (E.2-5, G.2, H.2-3)
Popis souboru: application/pdf
Přístupová URL adresa: http://geb.uni-giessen.de/geb/volltexte/2014/11056/pdf/Ifig_Report1401.pdf
http://www.informatik.uni-giessen.de/reports/Report1401.pdf
https://link.springer.com/chapter/10.1007/978-3-319-09698-8_26
https://rd.springer.com/chapter/10.1007/978-3-319-09698-8_26
http://geb.uni-giessen.de/geb/volltexte/2014/11056/ -
13
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors F.2.2 [Theory of Computation, Nonnumerical Algorithms and Problems—Computations on discrete structures, D.1.3 [Software, Programming Techniques—Concurrent programming
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.364.133; http://supertech.csail.mit.edu/papers/pbfs.pdf
-
14
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems-- Computations on discrete structures, C.2.1 [ComputerCommunication Networks, Network Architecture and
Popis souboru: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.634; http://theory.lcs.mit.edu/tds/papers/Hajiaghayi/mobicom03.ps
-
15
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--Computations on discrete structures, Sequencing and scheduling General Terms, Algorithms, Performance Additional Key Words and Phrases, Approximation algorithms for NP-hard problems, dynamic storage allocation, general caching, scheduling, resource allocation
Popis souboru: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.475; http://www.cs.technion.ac.il/~reuven/PS/survey.ps
-
16
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, D.3.4 [Programming Languages, Processors—compilers, E.1 [Data Structures, Graphs and Networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms General Terms, Algorithms, Languages, Performance, Theory Additional Key Words and Phrases, Compilers, dominators, flowgraphs, microtrees, path com
Popis souboru: application/pdf
-
17
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--computations on discrete structures, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms--algebraic algorithms, G.2 [Mathematics and Computing, Discrete Mathematics General Terms Algorithms Keywords Near-rings, Non-linear transformations, Groups
Popis souboru: application/postscript
-
18
Autoři:
Přispěvatelé:
Témata: ACM Categories and Subject Descriptors. E.1 [Data Structures, Distributed data structures, Graphs and networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Computations on discrete structures, Routing and layout, G.2 [Discrete Mathematics, G.2.1 Combinatorics – Combinatorial algorithms, G.2.2 Graph Theory – Graph algorithms, Graph labeling, Network problems. C.2.2 [Computer- Communication Networks, Network Protocols – Routing protocols. ACM General Terms. Algorithms, Performance, Theory Keywords. Routing schemes, multi-cast trees, distance labeling, triangulation, grid dimension, growthconstrained metrics, locality-awareness
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.1460; http://research.microsoft.com/users/slivkins/podc07_full.pdf
-
19
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, Geometrical problems and computations Keywords, computational topology, normal coordinates, geodesics
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.5945; http://compgeom.cs.uiuc.edu/~jeffe/pubs/pdf/tracingx.pdf
-
20
Autoři: a další
Přispěvatelé: a další
Témata: F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, Geometrical problems and computations General Terms Algorithms, Theory Keywords mesh generation, sparse Voronoi refinement, range spaces, epsilon nets, spread
Popis souboru: application/pdf
Nájsť tento článok vo Web of Science 
Full Text Finder