Sciweavers

1096 search results - page 131 / 220
» Computation Slicing: Techniques and Theory
Sort
View
DAC
2006
ACM
14 years 10 months ago
DAG-aware AIG rewriting a fresh look at combinational logic synthesis
This paper presents a technique for preprocessing combinational logic before technology mapping. The technique is based on the representation of combinational logic using And-Inve...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...
ICML
2004
IEEE
14 years 10 months ago
A comparative study on methods for reducing myopia of hill-climbing search in multirelational learning
Hill-climbing search is the most commonly used search algorithm in ILP systems because it permits the generation of theories in short running times. However, a well known drawback...
Lourdes Peña Castillo, Stefan Wrobel
WWW
2005
ACM
14 years 10 months ago
XQuery containment in presence of variable binding dependencies
Semantic caching is an important technology for improving the response time of future user queries specified over remote servers. This paper deals with the fundamental query conta...
Li Chen, Elke A. Rundensteiner
SIGMOD
2008
ACM
189views Database» more  SIGMOD 2008»
14 years 9 months ago
Dynamic anonymization: accurate statistical analysis with privacy preservation
A statistical database (StatDB) retrieves only aggregate results, as opposed to individual tuples. This paper investigates the construction of a privacy preserving StatDB that can...
Xiaokui Xiao, Yufei Tao
LATA
2009
Springer
14 years 4 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig