Hierarchical Spatial Gossip for Multi-Resolution Representations in Sensor Networks

Συγγραφείς: Rik Sarkar, Xianjin Zhu, Jie Gao

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.sunysb.edu/%7Ejgao/paper/multiresolution-journal.pdf.

Θεματικοί όροι: Categories and Subject Descriptors, C.2.2 [Computer-Communication Networks, Network protocols— Routing protocols, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Geometrical problems and computations General Terms, Algorithms, Design, Theory Additional Key Words and Phrases, Gossip, Multi-resolution representation, Order and Duplicate Insensitive Synopsis, Sensor Networks

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.7172
http://www.cs.sunysb.edu/%7Ejgao/paper/multiresolution-journal.pdf

I/O-Efficient Computation of Water Flow Across a Terrain

Συγγραφείς: Lars Arge, Morten Revsbæk, Norbert Zeh

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://users.cs.dal.ca/%7Enzeh/Publications/terrain_socg2010.pdf.

Θεματικοί όροι: Nonnumerical Algorithms and Problems—Geometrical problems and computations General Terms Algorithms, Theory Keywords Terrains, geographical information systems, I/O-efficient algorithms

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.1278; http://users.cs.dal.ca/%7Enzeh/Publications/terrain_socg2010.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.1278
http://users.cs.dal.ca/%7Enzeh/Publications/terrain_socg2010.pdf

Cleaning Massive Sonar Point Clouds

Συγγραφείς: Lars Arge, Thomas Mølhave

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.daimi.au.dk/~larsen/papers/cleaning_sonar.pdf.

Θεματικοί όροι: and problems—Geometrical problems and computations General Terms, Algorithms, Experimentation, Theory Keywords, MBES, noise removal, I/O-efficient algorithms, connected components ∗ Supported by MADALGO — Center for Massive Data Algorithmics

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.584; http://www.daimi.au.dk/~larsen/papers/cleaning_sonar.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.584
http://www.daimi.au.dk/~larsen/papers/cleaning_sonar.pdf

Incremental construction of the Delaunay triangulation and the Delaunay graph in medium dimension

Συγγραφείς: Jean-Daniel Boissonnat, Olivier Devillers, Samuel Hornus

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.loria.fr/%7Eshornus/skeleton/del-skel.pdf.

Θεματικοί όροι: measures, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems— Geometrical problems and computations General Terms Algorithms, Experiment, Performance Keywords Delaunay triangulation, Delaunay graph

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.2378
http://www.loria.fr/%7Eshornus/skeleton/del-skel.pdf

Faster Real Feasibility via Circuit Discriminants

Συγγραφείς: Frédéric Bihan, J. Maurice Rojas, Casey E. Stella

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.math.tamu.edu/~rojas/fin.pdf.

Θεματικοί όροι: Complexity, Nonnumerical Algorithms and Problems—Geometrical problems and Computations General Terms Algorithms, real, feasibility, polynomial-time, discriminant chamber, linear forms in logarithms

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.2209; http://www.math.tamu.edu/~rojas/fin.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.2209
http://www.math.tamu.edu/~rojas/fin.pdf

Walking Your Dog in the Woods in Polynomial Time

Συγγραφείς: Erin Wolf Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://compgeom.cs.uiuc.edu/~jeffe/pubs/pdf/frechetx.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, Performance Keywords, Homotopic Fréchet distance, geodesic leash map

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.5509; http://compgeom.cs.uiuc.edu/~jeffe/pubs/pdf/frechetx.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.5509
http://compgeom.cs.uiuc.edu/~jeffe/pubs/pdf/frechetx.pdf

Walking Your Dog in the Woods in Polynomial Time

Συγγραφείς: Erin Wolf Chambers, Jeff Erickson, Francis Lazarus

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.di.ens.fr/~colin/textes/06frechet.pdf.

Θεματικοί όροι: and Problems—Geometrical problems and computations General Terms, Algorithms, Performance Keywords, Homotopic Fréchet distance, geodesic leash map

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.6912; http://www.di.ens.fr/~colin/textes/06frechet.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.6912
http://www.di.ens.fr/~colin/textes/06frechet.pdf

Sparse data aggregation in sensor networks

Συγγραφείς: Jie Gao, Leonidas Guibas, Nikola Milosavljevic, John Hershberger

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.virginia.edu/~son/cs851/papers/ipsn07.aggregation.pdf.

Θεματικοί όροι: Categories and Subject Descriptors C.2.2 [Computer-Communication Networks, Network protocols—Routing protocols, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Geometrical problems and computations General Terms Algorithms, Design, Theory Keywords Aggregation, Sensor Networks

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.3437; http://www.cs.virginia.edu/~son/cs851/papers/ipsn07.aggregation.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.3437
http://www.cs.virginia.edu/~son/cs851/papers/ipsn07.aggregation.pdf

Differential Forms in Computational Algebraic Geometry (Extended Abstract)

Συγγραφείς: Peter Bürgisser, Peter Scheiblechner

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://math-www.upb.de/agpb/work/1diff-forms.pdf.

Θεματικοί όροι: Categories and Subject Descriptors I.1.2 [Symbolic and Algebraic Manipulation, Algorithms—Algebraic algorithms, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Geometrical problems and computations General Terms Algorithms, Theory Keywords complexity

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.4043
http://math-www.upb.de/agpb/work/1diff-forms.pdf

Does Topology Control Reduce Interference?

Συγγραφείς: Martin Burkhart, Pascal von Rickenbach, Roger Wattenhofer, Aaron Zollinger

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://distcomp.ethz.ch/publications/p7125-burkhart.ps.

Θεματικοί όροι: Nonnumerical Algorithms and Problems---geometrical problems and computations General Terms Algorithm, Theory Keywords Ad-hoc networks, interference, network connectivity, network

Περιγραφή αρχείου: application/postscript

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.7335
http://distcomp.ethz.ch/publications/p7125-burkhart.ps

Computing the visibility graph of points within a polygon

Συγγραφείς: Boaz Ben-moshe, Matthew J. Katz

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.bgu.ac.il/~matya/Papers/vg.ps.

Θεματικοί όροι: 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 Keywords, Visibility graphs, polygons, illumination, guarding, fatness, output-sensitive algorithms

Περιγραφή αρχείου: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.246; http://www.cs.bgu.ac.il/~matya/Papers/vg.ps

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.246
http://www.cs.bgu.ac.il/~matya/Papers/vg.ps

New Results on Shortest Paths in Three Dimensions

Συγγραφείς: Joseph S. B. Mitchell, Micha Sharir

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.ams.sunysb.edu/~jsbm/papers/p166-mitchell.pdf.

Θεματικοί όροι: Algorithms and Problems—geometrical problems and computations General Terms, Algorithms, Theory

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.6403
http://www.ams.sunysb.edu/~jsbm/papers/p166-mitchell.pdf

Computing the visibility graph of points within a polygon

Συγγραφείς: Boaz Ben-moshe

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.ams.sunysb.edu/~jsbm/papers/p219-mitchell.pdf.

Θεματικοί όροι: Algorithms and Problems—geometrical problems and computations General Terms, Algorithms, Theory Keywords, Visibility graphs, polygons, illumination, guarding, fatness, output-sensitive algorithms

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.7675
http://www.ams.sunysb.edu/~jsbm/papers/p219-mitchell.pdf

Algorithms for Center and Tverberg Points

Συγγραφείς: Pankaj K. Agarwal, Micha Sharir, Emo Welzl

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cis.upenn.edu/~cis610/tverberg.pdf.

Θεματικοί όροι: Problems—Geometrical problems and computations General Terms, Algorithms, Theory Keywords, Center Points, Colored Tverberg’s Theorem, j-Facets

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.4590; http://www.cis.upenn.edu/~cis610/tverberg.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.4590
http://www.cis.upenn.edu/~cis610/tverberg.pdf

Dynamic planar convex hull operations in near-logarithmic amortized time

Συγγραφείς: Timothy M. Chan

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://student.johnpdaigle.com/PDFs/p1-chan.pdf.

Θεματικοί όροι: Categories and Subject Descriptors, E.1 [Data, Data Structures, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—geometrical problems and computations General Terms, Algorithms, Theory Additional Key Words and Phrases, Computational geometry, convex hulls, dynamic data structures

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.457.325
http://student.johnpdaigle.com/PDFs/p1-chan.pdf

Constructing pairwise disjoint paths with few links

Συγγραφείς: Himanshu Gupta, Rephael Wenger

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.sunysb.edu/~hgupta/ps/links-talg.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 Additional Key Words and Phrases, link paths, noncrossing, polygon, isomorphic triangulations

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.1812
http://www.cs.sunysb.edu/~hgupta/ps/links-talg.pdf

Rectangle covers revisited computationally

Συγγραφείς: Laura Heinrich-Litan, Marco E. Lübbecke

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.math.tu-berlin.de/~luebbeck/papers/rcover-jea.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, Experimentation Additional Key Words and Phrases, Linear Programming, Integer Programming

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.4304
http://www.math.tu-berlin.de/~luebbeck/papers/rcover-jea.pdf

Designing Patrol Strategies to Maximize Pristine Forest Area

Συγγραφείς: Matthew P. Johnson, Fei Fang, Milind Tambe, H. J. Albers

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://teamcore.usc.edu/papers/2012/forestoptmas2012_cameraReady.pdf.

Θεματικοί όροι: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Compelxity, Non- numerical Algorithms and Problems—geometrical problems and computations General Terms Algorithm, Economics, Security, Theory Keywords patrol strategy, forest protection

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.463.4160; http://teamcore.usc.edu/papers/2012/forestoptmas2012_cameraReady.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.463.4160
http://teamcore.usc.edu/papers/2012/forestoptmas2012_cameraReady.pdf

Improving Chen & Han’s algorithm on the discrete geodesic problem [submitted for publication

Συγγραφείς: Shi-qing Xin, Guo-jin Wang

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.math.zju.edu.cn/webpagenew/UploadFiles/AttachFiles/200991322347818.pdf.

Θεματικοί όροι: Categories and Subject Descriptors, I.3.5 [Computer Graphics, Computational Geometry and Object Modeling—Geometric algorithms, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Geometrical problems and computations General Terms, Algorithms, Performance Additional Key Words and Phrases, Design and analysis of algorithms, computational geometry, shortest path problems ACM Reference Format

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.353.3162; http://www.math.zju.edu.cn/webpagenew/UploadFiles/AttachFiles/200991322347818.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.353.3162
http://www.math.zju.edu.cn/webpagenew/UploadFiles/AttachFiles/200991322347818.pdf

A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane

Συγγραφείς: John Hershberger, Subhash Suri, Hakan Yıldız

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.ucsb.edu/~suri/psdir/spaco.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 Keywords, Continuous Dijkstra, curved obstacles, polygonization, shortest

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.273; http://www.cs.ucsb.edu/~suri/psdir/spaco.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.273
http://www.cs.ucsb.edu/~suri/psdir/spaco.pdf