Sciweavers

4315 search results - page 787 / 863
» Sorting in linear time
Sort
View
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
14 years 29 days ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
COMPGEOM
2007
ACM
14 years 25 days ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
CPM
2006
Springer
125views Combinatorics» more  CPM 2006»
14 years 18 days ago
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
Tetsuo Shibuya
EMSOFT
2006
Springer
14 years 17 days ago
Time-triggered implementations of dynamic controllers
Bridging the gap between model-based design and platformbased implementation is one of the critical challenges for embedded software systems. In the context of embedded control sy...
Truong Nghiem, George J. Pappas, Rajeev Alur, Anto...
FOCS
2000
IEEE
14 years 14 days ago
How Bad is Selfish Routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
Tim Roughgarden, Éva Tardos