Sciweavers

350 search results - page 19 / 70
» Branching Programs for Tree Evaluation
Sort
View
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
14 years 8 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
ISCA
1999
IEEE
87views Hardware» more  ISCA 1999»
13 years 11 months ago
Dynamic Vectorization: A Mechanism for Exploiting Far-Flung ILP in Ordinary Programs
Several ILP limit studies indicate the presence of considerable ILP across dynamically far-apart instructions in program execution. This paper proposes a hardware mechanism, dynam...
Sriram Vajapeyam, P. J. Joseph, Tulika Mitra
KBSE
2009
IEEE
14 years 2 months ago
Reggae: Automated Test Generation for Programs Using Complex Regular Expressions
Abstract—Test coverage such as branch coverage is commonly measured to assess the sufficiency of test inputs. To reduce tedious manual efforts in generating high-covering test i...
Nuo Li, Tao Xie, Nikolai Tillmann, Jonathan de Hal...
ICALP
2007
Springer
14 years 1 months ago
Co-Logic Programming: Extending Logic Programming with Coinduction
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
Luke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta
AOSD
2007
ACM
13 years 11 months ago
Generating parallel applications for distributed memory systems using aspects, components, and patterns
Developing and debugging parallel programs particularly for distributed memory architectures is still a difficult task. The most popular approach to developing parallel programs f...
Purushotham V. Bangalore