Sciweavers

CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 11 months ago
Chunky and Equal-Spaced Polynomial Multiplication
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
Daniel S. Roche
ANOR
2007
58views more  ANOR 2007»
13 years 11 months ago
A fast swap-based local search procedure for location problems
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
Mauricio G. C. Resende, Renato Fonseca F. Werneck
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
14 years 7 days ago
Binary space partitions for 3D subdivisions
We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdiv...
John Hershberger, Subhash Suri
ESA
2008
Springer
97views Algorithms» more  ESA 2008»
14 years 20 days ago
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of tr...
Boris Aronov, Mark de Berg, Shripad Thite
ACSD
2006
IEEE
105views Hardware» more  ACSD 2006»
14 years 5 months ago
Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for...
Amir Hossein Ghamarian, Marc Geilen, Sander Stuijk...
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 11 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink