Search Results - Nonnumerical Algorithms and Problems–Computations on discrete structures
-
1
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: General Terms, Algorithms, Experimentation, Theory Additional Key Words and Phrases, Approximation algorithms, average case analysis, bin packing
File Description: 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
-
2
Authors:
Contributors:
Subject Terms: 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
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.364.133; http://supertech.csail.mit.edu/papers/pbfs.pdf
-
3
Authors:
Contributors:
Subject Terms: 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
File Description: 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
-
4
Authors:
Source: 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:3Subject Terms: 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
Access URL: 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 -
5
Authors: et al.
Contributors: et al.
Subject Terms: Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, H.3.3 [Information Storage
File Description: application/pdf
-
6
Authors:
Contributors:
Subject Terms: 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
File Description: application/pdf
-
7
Authors:
Contributors:
Subject Terms: 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
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.8615; http://arxiv.org/pdf/cs/0604020v2.pdf
-
8
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: 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
-
9
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: application/postscript
-
10
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: application/pdf
-
11
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: 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
-
12
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: 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
-
13
Authors:
Contributors:
Subject Terms: 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
File Description: 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
-
14
Authors:
Contributors:
Subject Terms: 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, Theory Additional Key Words and Phrases, Approximate distance oracles, spanners, distance labelings, shortest paths
File Description: application/pdf
-
15
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems-computations on discrete structures, G.2.1 [Discrete Mathematics, Graph Theory-graph algorithms, path and circuit problems General Terms, Algorithms, Network algorithms, Shortest paths Additional Key Words and Phrases, Functional complexity, time dependency, waiting times
File Description: application/pdf
-
16
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems-computations on discrete structures, G.2.1 [Discrete Mathematics, Graph Theory-graph algorithms, path and circuit problems General Terms, Algorithms, Network algorithms, Shortest paths Additional Key Words and Phrases, Functional complexity, time dependency, waiting times
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.7997; http://cs.ucsb.edu/~suri/cs231/Rlist/ordaRom.pdf
-
17
Authors: et al.
Contributors: et al.
Subject Terms: Categories and Subject Descriptors D.4.6 [Operating Systems, Security and Protection—information flow controls, D.4.6 [Oper- ating Systems, Security and Protection—access controls, D.3.4 [Programming Languages, Language Classifications—constraint and logic languages, D.3 [Programming Languages, Processors— code generation, optimization, E.1 [Data, Data Structures— arrays, lists, queues, records, F.2 [Analysis of Algorithms and Problems Complexity, Nonnumerical Algorithms and Problems— computations on discrete structures, I.2.2 [Artificial Intelligence, Automatic Programming—Program transformation, E.2 [Data, Data Storage Representations—linked representations General Terms security, algorithms, languages, performance Keywords information flow, type inference, security, algorithm, time
File Description: application/pdf
-
18
Authors:
Contributors:
Subject Terms: 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
File Description: 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
-
19
Authors:
Contributors:
Subject Terms: 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
File Description: 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
-
20
Authors: et al.
Contributors: et al.
Subject Terms: Categories and Subject Descriptors, G.2.2 [Discrete Mathematics, Graph theory—Network problems, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Performance Keywords, computational topology, combinatorial optimization Errors, like straws, upon the surface flow, He who would search for pearls must dive below
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.305.1370; http://mathcs.slu.edu/~chambers/papers/surflow.pdf
Nájsť tento článok vo Web of Science 
Full Text Finder