Showing 201 - 220 of 321

201

Natural neighbor interpolation based grid dem construction using a gpu
Alex Beutel ; Thomas Mølhave ; Pankaj K. Agarwal ; et al.
http://alexbeutel.com/papers/acmgis10.nni.pdf.

Categories and Subject D... D.2 [Software Software Engineering F.2.2 [Nonnumerical Algo... Geometrical problems and... H.2.8 [Database Manageme...
Academic journal
Save to List
202

A Logarithmic Approximation for Unsplittable Flow on Line Graphs
Nikhil Bansal ; Zachary Friggstad ; ROHIT KHANDEKAR ; et al.
http://webdocs.cs.ualberta.ca/~mreza/research/UFP-jrl.pdf.

Categories and Subject D... F.2.2 [Nonnumerical Algo... Computations on Discrete... Algorithms Theory Additional Key Wo... Approximation algorithms
Academic journal
Save to List
203

Better Scalable Algorithms for Broadcast Scheduling
Nikhil Bansal ; RAVISHANKAR KRISHNASWAMY ; VISWANATH NAGARAJAN ; et al.
http://www.cs.cmu.edu/~ravishan/files/papers/broadcast.pdf.

Categories and Subject D... F.2.2 [Nonnumerical Algo... Sequencing and Schedulin... Algorithms Additional Ke... Online Algorithms Broadcast Scheduling
Academic journal
Save to List
204

Private coresets
Dan Feldman ; Amos Fiat ; Haim Kaplan ; et al.
http://people.csail.mit.edu/dannyf/private.pdf.

Categories and Subject D... F. [Theory of Computatio... F.2 [Analysis of Algorit... F.2.2 [Nonnumerical Algo... Geometrical problems and... Algorithms
Academic journal
Save to List
205

Experimental Study of Geometric t-Spanners
Mohammad Farshi ; Joachim Gudmundsson ; The Pennsylvania State University CiteSeerX Archives
http://nicta.com.au/research/research_publications?sq_content_src=%2BdXJsPWh0dHBzJTNBJTJGJTJGcHVibGljYXRpb25zLmluc2lkZS5uaWN0YS5jb20uYXUlMkZzZWFyY2glMkZmdWxsdGV4dCUzRmlkJTNEMzM0MSZhbGw9MQ%3D%3D.

Categories and Subject D... I.3.5 [Computational Geo... Geometric algorithms F.2.2 [Nonnumerical Algo... Geometrical problems and... Algorithms Additional Ke...
Academic journal
Save to List
206

The effect of power-law degrees on the navigability of small worlds
Pierre Fraigniaud ; The Pennsylvania State University CiteSeerX Archives
http://www.liafa.jussieu.fr/~pierref/POSTSCRIPTS/PODC2009FG.pdf.

Categories and Subject D... Routing and layout E.1 [Data Structures Graphs and networks G.2.2 [Graph Theory Graph algorithms
Academic journal
Save to List
207

Comprehensive multi-component heart reconstruction from volumetric imaging
Chandrajit Bajaj ; Samrat Goswami ; The Pennsylvania State University CiteSeerX Archives
http://cvcweb.ices.utexas.edu/ccv/papers/2008/conference/Bajaj-Goswami-SPM2008-final.pdf.

CR Categories F.2.2 [Nonnumerical Algo... Geometrical problems and... I.3.5 [Computational Ge-...
Academic journal
Save to List
208

Minimum weight triangulation is NP-hard
Wolfgang Mulzer ; Günter Rote ; The Pennsylvania State University CiteSeerX Archives
http://page.inf.fu-berlin.de/~rote/Papers/pdf/Minimum-weight+triangulation+is+NP-hard.pdf.

Categories and Subject D... F.2.2 [Nonnumerical Algo... Geometrical problems and... G.2.2 [Graph Theory Graph algorithms General... Algorithms
Academic journal
Save to List
209

Markov Incremental Constructions
Bernard Chazelle ; Wolfgang Mulzer ; The Pennsylvania State University CiteSeerX Archives
http://www.cs.princeton.edu/~wmulzer/micSoCG.pdf.

F.2.2 [Nonnumerical Algo... Geometrical problems and... G.3 [Probability and Sta... Markov processes General... Theory Keywords Randomiz... Expander graphs
Academic journal
Save to List
210

Rectangular Layouts and Contact Graphs
Adam L. Buchsbaum ; Emden R. Gansner ; Cecilia M. Procopiuc ; et al.
http://adambuchsbaum.com/papers/rectlay.pdf.

Categories and Subject D... F.2.2 [Nonnumerical Algo... Computations on discrete... G.2.2 [Graph Theory Graph algorithms General... Algorithms
Academic journal
Save to List
211

Minimum-Weight Triangulation is NP-hard
Wolfgang Mulzer ; Günter Rote ; The Pennsylvania State University CiteSeerX Archives
http://page.inf.fu-berlin.de/~rote/Papers/pdf-gzipped/Minimum-weight+triangulation+is+NP-hard.pdf.gz.

Categories and Subject D... F.2.2 [Nonnumerical Algo... Geometrical problems and... G.2.2 [Graph Theory Graph algorithms General... Algorithms
Academic journal
Save to List
212

The impact of platform models on scheduling techniques
Eyraud-Dubois, Lionel ; Legrand, Arnaud ; Algorithmics for computationally intensive applications over wide scale distributed platforms (CEPAGE) ; et al.
Yves Robert and Frédéric Vivien. Introduction to Scheduling, Taylor and Francis, 2009

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.5: Sequencing and... [INFO.INFO-DC]Computer S... Distributed, Parallel, a...
Book
Save to List
213

Complexity results on DPLL and resolution
Paolo Liberatore ; The Pennsylvania State University CiteSeerX Archives
http://klase.itc.it/paper_firb_astro_klase/unirm/LiberatoreTOCL06.pdf.

Categories and Subject D... F.2.2 [Nonnumerical Algo... Complexity of proof proc... F.1.3 [Complexity Measur... Complexity hierarchies F.4.1 [Mathematical Logi...
Academic journal
Save to List
214

Oscillations with TCP-like Flow Control in Networks of Queues
Matthew Andrews ; Rs Slivkins ; The Pennsylvania State University CiteSeerX Archives
http://arxiv.org/pdf/0812.1321v1.pdf.

Categories and subject d... F.2.2 [Nonnumerical Algo... Sequencing and schedulin... algorithms. Keywords routing scheduling
Academic journal
Save to List
215

Geometric Containers for Efficient Shortest-Path Computation
Dorothea Wagner ; Thomas Willhalm ; Christos Zaroliagis ; et al.
http://i11www.iti.uni-karlsruhe.de/extra/publications/wwz-gcesp-05.pdf.

Categories and Subject D... G.2.2 [Graph Theory Graph algorithms Network problems G.2.3 [Applications Traffic information syst...
Academic journal
Save to List
216

G.: On the adaptiveness of quicksort
Gerth Stølting Brodal ; Rolf Fagerberg ; Gabriel Moruz ; et al.
http://www.brics.dk/~gerth/Papers/jea07quicksort.pdf.

Categories and Subject D... F.2.2 [Nonnumerical Algo... Nonnumerical Algorithms... Algorithms Additional Ke... adaptive sorting Quicksort
Academic journal
Save to List
217

Classifying Scheduling Policies with Respect to Higher Moments of Conditional Response Time
Adam Wierman ; Mor Harchol-Balter ; The Pennsylvania State University CiteSeerX Archives
http://www.cs.cmu.edu/~harchol/Papers/Sigmetrics05a.ps.

Categories and Subject D... Sequencing and Schedulin... G.3 [Probability and Sta... Queueing Theory C.4 [Performance of Syst... Performance Attributes G...
Academic journal
Save to List
218

Approximating connectivity augmentation problems
Zeev Nutov ; The Pennsylvania State University CiteSeerX Archives
http://www.openu.ac.il/home/nutov/TALG09.pdf.

Categories and Subject D... F.2.2 [Nonnumerical Algo... Computations on discrete... G.2.2 [Discrete Mathemat... Graph Algorithms General... Approximation Algorithms
Academic journal
Save to List
219

A Three-way Merge for XML Documents
Tancred Lindholm ; The Pennsylvania State University CiteSeerX Archives
http://www.hiit.fi/fuego/fc/doceng04-pc.pdf.

F.2.2 [Nonnumerical Algo...
Academic journal
Save to List
220

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations
Sandor P. Fekete ; Marco E. Lübbecke ; Henk Meijer ; et al.
http://arxiv.org/pdf/cs/0310034v1.pdf.

Classification F.2.2 Nonnumerical Algor... Stabbing number crossing number matching spanning tree
Academic journal
Save to List

Filter