Výsledky vyhľadávania - "F.2.2 [Analysis of algorithms and problem complexity]: Nonnumerical algorithms and problems"

Optimal Algorithms for Compact Linear Layouts

Autori: Willem Sonke Eric Verbeek Wouter Meulemans a ďalší

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

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

Prístupová URL adresa: 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

Autori: Fabian Kuhn Roger Wattenhofer Aaron Zollinger a ďalší

Prispievatelia: Fabian Kuhn Roger Wattenhofer Aaron Zollinger a ďalší

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

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

Popis súboru: application/pdf

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

Dostupnosť: 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

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

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

Predmety: pseudo-triangulation, kinetic data structure

Popis súboru: application/pdf

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

Dostupnosť: 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

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

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

Predmety: word-RAM algorithms, sorting, point location, convex hulls, segment intersection

Popis súboru: 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

Dostupnosť: 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

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

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

Predmety: graph algorithms, computational geometry, matrix multiplication

Popis súboru: 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

Dostupnosť: 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

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

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

Predmety: General Terms, Algorithms, Experimentation Additional Key Words and Phrases, Linear Programming, Integer Programming

Popis súboru: application/postscript

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

Dostupnosť: 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

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

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

Predmety: General Terms, Algorithms Additional Key Words and Phrases, String algorithms, approximation algorithms

Popis súboru: 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

Dostupnosť: 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

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

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

Predmety: routing, mobile network, dynamic graphs

Popis súboru: application/postscript

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

Dostupnosť: 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.

Autori: Khaireel A. Mohamed Tobias Langner Thomas Ottmann a ďalší

Prispievatelia: Khaireel A. Mohamed Tobias Langner Thomas Ottmann a ďalší

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

Predmety: Partial persistence, path-merging, path-copying, node

Popis súboru: application/pdf

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

Dostupnosť: 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

Autori: Leslie De Koninck The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Leslie De Koninck The Pennsylvania State University CiteSeerX Archives

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

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

Popis súboru: 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

Dostupnosť: 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.

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

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

Predmety: *VORONOI polygons, *SCALAR field theory, *ALGORITHMS, *APPROXIMATION theory, *GEOMETRIC vertices, *COMPUTATIONAL geometry

Heuristics for estimating contact area of supports in layered manufacturing

Autori: Ilinkin, I. (Ivayio) Janardan, R. (Ravi) Smid, M. (Michiel) a ďalší

Zdroj: Journal of Experimental Algorithmics vol. 11

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

Dostupnosť: https://ir.library.carleton.ca/pub/8655
https://doi.org/10.1145/1187436.1210589

Computing MEMs and Relatives on Repetitive Text Collections.

Autori: Navarro, Gonzalo

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

Predmety: CODING theory, DATA structures, INFORMATION theory, DATA warehousing, COMPRESSIBILITY

Mandatory Critical Points of 2D Uncertain Scalar Fields.

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

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

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

An optimal algorithm for approximate nearest neighbor searching in fixed dimensions

Autori: Arya, Sunil Mount, David M. Netanyahu, Nathan S. a ďalší

Predmety: Algorithms, Approximation algorithms, E.1 [Data]: Data Structures, F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems, H.3.3 [Information Storage and Retrieval]: Information Search and Retrieval, Theory

Relation: https://doi.org/10.1145/293347.293348; http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000079394600001

Dostupnosť: http://repository.hkust.edu.hk/ir/Record/1783.1-30339
https://doi.org/10.1145/293347.293348
http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=0004-5411&rft.volume=45&rft.issue=6&rft.date=1998&rft.spage=891&rft.epage=923&rft.aulast=Arya&rft.aufirst=S&rft.atitle=An+optimal+algorithm+for+approximate+nearest+neighbor+searching+in+fixed+dimensions
http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000079394600001
http://www.scopus.com/record/display.url?eid=2-s2.0-0032201716&origin=inward

MLS: An Efficient Location Servicefor Mobile Ad Hoc Networks

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

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

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

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

Popis súboru: application/postscript

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

Dostupnosť: 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

Autori: Khaireel A. Mohamed Tobias Langner Thomas Ottmann a ďalší

Prispievatelia: Khaireel A. Mohamed Tobias Langner Thomas Ottmann a ďalší

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

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

Popis súboru: application/pdf

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

Dostupnosť: 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.

Autori: Sheehy, Donald R.¹

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

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

Computing MEMs and Relatives on Repetitive Text Collections

Autori: Gonzalo Navarro

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

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

Prístupová URL adresa: http://arxiv.org/abs/2210.09914

Continuous Sampling from Distributed Streams.

Autori: CORMODE, GRAHAM MUTHUKRISHNAN, S. YI, KE a ďalší

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

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