Sciweavers

564 search results - page 61 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
GD
2005
Springer
14 years 3 months ago
Non-planar Core Reduction of Graphs
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
Carsten Gutwenger, Markus Chimani
CORR
2011
Springer
161views Education» more  CORR 2011»
13 years 1 months ago
Quadratic Goldreich-Levin Theorems
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
Madhur Tulsiani, Julia Wolf
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
13 years 11 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
ICCS
2005
Springer
14 years 3 months ago
Generating Parallel Algorithms for Cluster and Grid Computing
We revisit and use the dependence transformation method to generate parallel algorithms suitable for cluster and grid computing. We illustrate this method in two applications: to o...
Ulisses Kendi Hayashida, Kunio Okuda, Jairo Panett...
OPODIS
2004
13 years 11 months ago
Clock Synchronization for Wireless Networks
Abstract. Time synchronization is a fundamental service in many wireless applications. While the synchronization problem is well-studied in traditional wired networks, physical con...
Rui Fan, Indraneel Chakraborty, Nancy A. Lynch