Sciweavers

1290 search results - page 90 / 258
» Data Dependence Testing in Practice
Sort
View
SIGSOFT
1994
ACM
14 years 1 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...
ACML
2009
Springer
14 years 1 months ago
Learning Algorithms for Domain Adaptation
A fundamental assumption for any machine learning task is to have training and test data instances drawn from the same distribution while having a sufficiently large number of tra...
Manas A. Pathak, Eric Nyberg
RR
2010
Springer
13 years 7 months ago
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...
MMAS
2010
Springer
13 years 3 months ago
Clustering and Classification through Normalizing Flows in Feature Space
A unified variational methodology is developed for classification and clustering problems, and tested in the classification of tumors from gene expression data. It is based on flu...
J. P. Agnelli, M. Cadeiras, E. G. Tabak, C. V. Tur...
ICCAD
1996
IEEE
92views Hardware» more  ICCAD 1996»
14 years 1 months ago
Generation of BDDs from hardware algorithm descriptions
We propose a new method for generating BDDs from hardware algorithm descriptions written in a programming language. Our system can deal with control structures, such as conditiona...
Shin-ichi Minato