Sciweavers

2069 search results - page 146 / 414
» Linear time algorithms for Clobber
Sort
View
ESA
2005
Springer
155views Algorithms» more  ESA 2005»
15 years 10 months ago
Highway Hierarchies Hasten Exact Shortest Path Queries
We present a new speedup technique for route planning that exploits the hierarchy inherent in real world road networks. Our algorithm preprocesses the eight digit number of nodes n...
Peter Sanders, Dominik Schultes
IPPS
2000
IEEE
15 years 9 months ago
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
Jie Wu
ISPD
1999
ACM
83views Hardware» more  ISPD 1999»
15 years 8 months ago
Efficient solution of systems of orientation constraints
One subtask in constraint-driven placement is enforcing a set of orientation constraints on the devices being placed. Such constraints are created in order to, for example, implem...
Joseph L. Ganley
SIAMSC
2008
129views more  SIAMSC 2008»
15 years 4 months ago
Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
Hari Sundar, Rahul S. Sampath, George Biros
NIPS
2008
15 years 6 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic