Search Results - "Nonnumerical Algorithms and Problems − computations on discrete structures"
-
1
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 -
2
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
-
3
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: application/pdf
-
4
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 General Terms, Algorithms, Theory Additional Key Words and Phrases, Kernelization, Lower Bounds, Max-Leaf Spanning Tree, Out-Branching, Parameterized Algorithms ACM Reference Format
File Description: 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
-
5
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, Combinatorics—Generating functions, counting problems General Terms, Algorithms Additional Key Words and Phrases, Autocorrelation polynomials, complex asymptotics, constrained sequences, languages, neuronal spike trains, pattern matching ACM Reference Format
File Description: application/pdf
-
6
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
-
7
Authors:
Contributors:
Subject Terms: F.2.2 [Analysis of Algorithms and Problems Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, H.2.3 [Information Systems, Database Management— Query languages, H.2.4 [Information Systems, Systems—Query processing, Rule-based databases General Terms Languages, Performance Keywords Complexity analysis, Datalog, demand-driven evaluation, program transformation
File Description: application/pdf
-
8
Authors: et al.
Contributors: et al.
Subject Terms: Categories and Subject Descriptors, E.2 [Data, Data Storage Representations—hash table representations, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—Counting problems, Generating functions, G.2.2 [Discrete Mathematics, Graph Theory General Terms, Algorithms Additional Key Words and Phrases, Hashing, Cuckoo hashing, random bipartite graphs, saddle point
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.2272; http://www.dmg.tuwien.ac.at/drmota/cuckoohash.pdf
-
9
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
-
10
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
-
11
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.3[Probability and Statistics, Probabilistic Algorithms General Terms Algorithms, Theory Keywords Evolutionary algorithms, dynamic evolutionary computation, runtime analysis
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.911; http://www.cs.bham.ac.uk/%7Exin/papers/RohlfshagenLehreYao09GECCO.pdf
-
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, G.3[Probability and Statistics, Probabilistic Algorithms General Terms Algorithms, Theory Keywords Evolutionary algorithms, dynamic evolutionary computation, runtime analysis
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.6550; http://www.cs.bham.ac.uk/~pkl/publications/rly2009dynamic.pdf
-
13
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
-
14
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.2 [Discrete Mathematics, Graph Theory—Graph algorithms Additional Key Words and Phrases, Distributed computing, rumor spreading, broadcasting, quasirandomness, random
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.2 [Discrete Mathematics, Graph Theory—graph algorithms, Graph Theory—network problems General Terms Algorithms, Theory Keywords capacities, dominating sets, distributed approximation
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.320.9798; http://www.cadmo.ethz.ch/as/people/alumni/fkuhn/pubs/spaa07b.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 General Terms, Algorithms, Theory Keywords, computational topology, multidimensional analysis, persistent
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.1620; http://comptop.stanford.edu/preprints/multidimensional.pdf
-
17
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
-
18
Authors:
Contributors:
Subject Terms: Nonnumerical Algorithms and Problems–Computations on discrete structures, Geometrical problems and computations General Terms Algorithms, Theory Keywords bottleneck path, maximum capacity path, matrix multiplication, sub-cubic time
File Description: application/pdf
-
19
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, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, Graph Theory—network problems General Terms Algorithms, Theory Keywords Data Aggregation, Distributed Algorithms, In-Network Aggregation, Median, Time Complexity, Sensor Networks
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.6192; http://www.tik.ee.ethz.ch/file/5a15f565006b60eac7b39b7e61885879/spaa07.pdf
-
20
Authors: et al.
Contributors: et al.
Subject Terms: Categories and Subject Descriptors, E.1 [Data, Data Structures—Arrays, Trees, E.4 [Data, Coding and Information Theory—Data compaction and compression, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, E.2 [Data, Data Storage Representations, H.3.1 [Information Storage and Retrieval, Content Analysis and Indexing— Indexing methods General Terms, Algorithms, Design, Theory The preliminary versi
File Description: application/pdf
Full Text Finder 
Nájsť tento článok vo Web of Science