Suchergebnisse - "F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems"

Optimal Algorithms for Compact Linear Layouts

Autoren: Willem Sonke Eric Verbeek Wouter Meulemans et al.

Quelle: 2018 IEEE Pacific Visualization Symposium (PacificVis). :1-10

Schlagwörter: Graph/Network Data, Geometry based Techniques, 11. Sustainability, Folding, Linear layouts, F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems, 0102 computer and information sciences, Routing and layout, 01 natural sciences

Zugangs-URL: https://research.tue.nl/en/publications/2e370ddf-e3bd-4d42-87f7-53d8bb312fdf
https://research.tue.nl/en/publications/optimal-algorithms-for-compact-linear-layouts-2
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2Ff550cf2b-aef8-4e45-ac94-300fb43ddd2c
https://ieeexplore.ieee.org/document/8365970/
https://dblp.uni-trier.de/db/conf/apvis/pacificvis2018.html#SonkeVMVS18
http://doi.ieeecomputersociety.org/10.1109/PacificVis.2018.00010

Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems—geometrical

Autoren: Fabian Kuhn Roger Wattenhofer Aaron Zollinger et al.

Weitere Verfasser: Fabian Kuhn Roger Wattenhofer Aaron Zollinger et al.

Quelle: http://theory.csail.mit.edu/classes/6.885/spring06/papers/KuhnWZ-dialm03.pdf.

Schlagwörter: General Terms Algorithms, Performance, Theory Keywords Ad-Hoc Networks, Face Routing, Flooding, Geometric Routing, Mobile Computing, Modeling, Unit Disk Graphs, Wireless Communication

Dateibeschreibung: application/pdf

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

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.9191
http://theory.csail.mit.edu/classes/6.885/spring06/papers/KuhnWZ-dialm03.pdf

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

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.stolaf.edu/people/olaf/papers/vid06-hall-holt.pdf.

Schlagwörter: pseudo-triangulation, kinetic data structure

Dateibeschreibung: application/pdf

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

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.3523
http://www.stolaf.edu/people/olaf/papers/vid06-hall-holt.pdf

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

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cs.uwaterloo.ca/~tmchan/nearlin_stoc.ps.

Schlagwörter: word-RAM algorithms, sorting, point location, convex hulls, segment intersection

Dateibeschreibung: application/postscript

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

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.9362
http://www.cs.uwaterloo.ca/~tmchan/nearlin_stoc.ps

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

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

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

Schlagwörter: graph algorithms, computational geometry, matrix multiplication

Dateibeschreibung: 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

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

Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems--Geometrical problems and computations

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.math.tu-berlin.de/~luebbeck/papers/rcover-jea.ps.gz.

Schlagwörter: General Terms, Algorithms, Experimentation Additional Key Words and Phrases, Linear Programming, Integer Programming

Dateibeschreibung: application/postscript

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

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.6595
http://www.math.tu-berlin.de/~luebbeck/papers/rcover-jea.ps.gz

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

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

Quelle: http://matsrv.math.cas.cz/~sgall/ps/strings.ps.

Schlagwörter: General Terms, Algorithms Additional Key Words and Phrases, String algorithms, approximation algorithms

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.9320; http://matsrv.math.cas.cz/~sgall/ps/strings.ps

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.9320
http://matsrv.math.cas.cz/~sgall/ps/strings.ps

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

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

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

Schlagwörter: routing, mobile network, dynamic graphs

Dateibeschreibung: application/postscript

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

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

Data Storage Representations – linked representations; F.2.2 [Analysis of Algorithms and Problem Complexity] Nonnumerical Algorithms and Problems – Geometrical problems and computations.

Autoren: Khaireel A. Mohamed Tobias Langner Thomas Ottmann et al.

Weitere Verfasser: Khaireel A. Mohamed Tobias Langner Thomas Ottmann et al.

Quelle: http://dcg.ethz.ch/publications/mohamed_langner_ottmann_faw08_pub_-1.pdf.

Schlagwörter: Partial persistence, path-merging, path-copying, node

Dateibeschreibung: application/pdf

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

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.5226
http://dcg.ethz.ch/publications/mohamed_langner_ottmann_faw08_pub_-1.pdf

Nonnumerical Algorithms and Problems — Sequencing and schedulingMergeable Schedules for Lazy Matching

Autoren: Leslie De Koninck The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Leslie De Koninck The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cs.kuleuven.ac.be/publicaties/rapporten/cw/CW505.pdf.

Schlagwörter: Schedules, lazy pattern matching, rule based languages. CR Subject Classification, E.1 [Data Structures, F.2.2 [Analysis of Algorithms and Problem Complexity] Nonnumerical Algorithms and Problems — Pattern, F.2.2 [Analysis of Algorithms and Problem Complexity

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.5474; http://www.cs.kuleuven.ac.be/publicaties/rapporten/cw/CW505.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.5474
http://www.cs.kuleuven.ac.be/publicaties/rapporten/cw/CW505.pdf

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams.

Autoren: Bennett, H. Papadopoulou, E. Yap, C.

Quelle: Computer Graphics Forum. Aug2016, Vol. 35 Issue 5, p229-247. 19p.

Schlagwörter: *VORONOI polygons, *SCALAR field theory, *ALGORITHMS, *APPROXIMATION theory, *GEOMETRIC vertices, *COMPUTATIONAL geometry

Heuristics for estimating contact area of supports in layered manufacturing

Autoren: Ilinkin, I. (Ivayio) Janardan, R. (Ravi) Smid, M. (Michiel) et al.

Quelle: Journal of Experimental Algorithmics vol. 11

Schlagwörter: Algorithm implementation and testing, Algorithms, Computational geometry, E.1 [Data structures], Experimentation, F.2.2 [Analysis of algorithms and problem complexity]: Nonnumerical algorithms and problems, I.6 [Computer-aided engineering], Measurement, Performance, Theory

Relation: https://ir.library.carleton.ca/pub/8655

Verfügbarkeit: https://ir.library.carleton.ca/pub/8655
https://doi.org/10.1145/1187436.1210589

Computing MEMs and Relatives on Repetitive Text Collections.

Autoren: Navarro, Gonzalo

Quelle: ACM Transactions on Algorithms; Jan2025, Vol. 21 Issue 1, p1-33, 33p

Schlagwörter: CODING theory, DATA structures, INFORMATION theory, DATA warehousing, COMPRESSIBILITY

Mandatory Critical Points of 2D Uncertain Scalar Fields.

Autoren: Günther, David Salmon, Joseph Tierny, Julien

Quelle: Computer Graphics Forum. Jun2014, Vol. 33 Issue 3, p31-40. 10p. 5 Diagrams, 1 Chart, 2 Graphs, 1 Map.

Schlagwörter: *PROBABILITY density function, *CRITICAL point (Thermodynamics), *ESTIMATION theory, *DATA analysis, *VISUALIZATION, *NUMERICAL analysis

MLS: An Efficient Location Servicefor Mobile Ad Hoc Networks

Autoren: Roger Wattenhofercomputer Engineering Eth Zurich The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Roger Wattenhofercomputer Engineering Eth Zurich The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.distcomp.ethz.ch/publications/mobihoc06a.ps.

Schlagwörter: Categories and Subject Descriptors, C.2.2 [ComputerCommunication Networks] Network Protocols, F.2.2 [Analysis of Algorithms and Problem Complexity] Nonnumerical Algorithms and Problems General T, Algorithms, Performance Keywords, Location Service, MANET, Mobility, Ad Hoc Geo-Routing

Dateibeschreibung: application/postscript

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

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.8448
http://www.distcomp.ethz.ch/publications/mobihoc06a.ps

Versioning Tree Structures by Path-Merging

Autoren: Khaireel A. Mohamed Tobias Langner Thomas Ottmann et al.

Weitere Verfasser: Khaireel A. Mohamed Tobias Langner Thomas Ottmann et al.

Quelle: http://www.tik.ee.ethz.ch/file/6c26cf31ee56b9d477eda40f7e5b6e91/mohamed_langner_ottmann_faw08_pub_-1.pdf.

Schlagwörter: Subject Classifications, E.1[Data, Data Structures – trees, E.2[Data, Data Storage Representations – linked representations, F.2.2 [Analysis of Algorithms and Problem Complexity] Nonnumerical Algorithms and Problems – Geometr, path-merging, path-copying, node

Dateibeschreibung: application/pdf

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

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.7083
http://www.tik.ee.ethz.ch/file/6c26cf31ee56b9d477eda40f7e5b6e91/mohamed_langner_ottmann_faw08_pub_-1.pdf

New Bounds on the Size of Optimal Meshes.

Autoren: Sheehy, Donald R.¹

Quelle: Computer Graphics Forum. Aug2012, Vol. 31 Issue 5, p1627-1635. 9p. 5 Diagrams.

Schlagwörter: *NUMERICAL analysis, *MATHEMATICAL analysis, *EQUATIONS, *DEFECT correction methods (Numerical analysis), *ANALYTIC geometry, *NONLINEAR theories

Computing MEMs and Relatives on Repetitive Text Collections

Autoren: Gonzalo Navarro

Quelle: ACM Transactions on Algorithms. 21:1-33

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/2210.09914

Continuous Sampling from Distributed Streams.

Autoren: CORMODE, GRAHAM MUTHUKRISHNAN, S. YI, KE et al.

Quelle: Journal of the ACM; Apr2012, Vol. 59 Issue 2, p10.1-10.25, 25p

Schlagwörter: DATA flow computing, STATISTICAL sampling software, DISTRIBUTED databases, STREAMING technology, FLOW control (Data transmission systems), COMPUTATIONAL complexity, DATABASE management software

Polylogarithmic Concurrent Data Structures from Monotone Circuits.

Autoren: ASPNES, JAMES ATTIYA, HAGIT CENSOR-HILLEL, KEREN

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

Schlagwörter: DATA structures, LOGARITHMIC functions, COMPUTER circuits, COMPUTATIONAL complexity, ALGORITHMS, COMPUTER programming, MACHINE theory