Sciweavers

927 search results - page 26 / 186
» A Data Abstraction Alternative to Data Structure Algorithm M...
Sort
View
OOPSLA
2004
Springer
15 years 5 months ago
Modular generics
This paper presents the design of G, a new language specifically created for generic programming. We review and identify important language features of C++ and Haskell in light o...
Jeremy G. Siek
MICCAI
2003
Springer
16 years 1 months ago
Relative Performance of Geometric Search Algorithms for Interpolating Unstructured Mesh Data
Abstract. Interpolation of field data from unstructured meshes requires the potentially expensive identification of the finite element or volume within which the interpolating poin...
Mahdieh Khoshniat, Gordan R. Stuhne, David A. Stei...
ER
2006
Springer
112views Database» more  ER 2006»
15 years 4 months ago
A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
Johann Eder, Karl Wiggisser
WWW
2008
ACM
16 years 1 months ago
A framework for fast community extraction of large-scale networks
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...
Yutaka I. Leon-Suematsu, Kikuo Yuta
95
Voted
ML
2006
ACM
15 years 13 days ago
Type-sensitive control-flow analysis
Higher-order typed languages, such as ML, provide strong support for data and type abn. While such abstraction is often viewed as costing performance, there are situations where i...
John H. Reppy