Sciweavers

2715 search results - page 271 / 543
» An Implementation of Narrowing Strategies
Sort
View
PADL
2007
Springer
16 years 23 days ago
Rewriting Haskell Strings
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...
Duncan Coutts, Don Stewart, Roman Leshchinskiy
PSIVT
2007
Springer
143views Multimedia» more  PSIVT 2007»
16 years 23 days ago
Approximate ESPs on Surfaces of Polytopes Using a Rubberband Algorithm
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
Fajie Li, Reinhard Klette, Xue Fu
SPIRE
2007
Springer
16 years 22 days ago
Generalized LCS
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva ...
VAMOS
2007
Springer
16 years 22 days ago
Using Goal-Models to Analyze Variability
On our ongoing research on variability analysis, two major drawbacks have been identified: a) the lack of an effective tracing from the rationale to the selected variant, and b) t...
Bruno González-Baixauli, Miguel A. Laguna, ...
ASAP
2006
IEEE
109views Hardware» more  ASAP 2006»
16 years 21 days ago
Describing Quantum Circuits with Systolic Arrays
In the simulation of quantum circuits the matrices and vectors used to represent unitary operations and qubit states grow exponentially as the number of qubits increase. For insta...
Aasavari Bhave, Eurípides Montagne, Edgar G...