Sciweavers

2104 search results - page 11 / 421
» Sorting with networks of data structures
Sort
View
ESA
2006
Springer
92views Algorithms» more  ESA 2006»
13 years 11 months ago
Out-of-Order Event Processing in Kinetic Data Structures
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...
QSIC
2003
IEEE
14 years 19 days ago
A Note on Test Oracles and Semantics of Algebraic Specifications
Algebraic testing is an automated software testing method based on algebraic formal specifications. It tests if a program correctly implements an algebraic specification by checki...
Hong Zhu
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
13 years 11 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
COCOON
1999
Springer
13 years 11 months ago
An External Memory Data Structure for Shortest Path Queries
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
PVG
2003
IEEE
138views Visualization» more  PVG 2003»
14 years 19 days ago
Sort-First, Distributed Memory Parallel Visualization and Rendering
While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpos...
E. Wes Bethel, Greg Humphreys, Brian E. Paul, J. D...