Sciweavers

119 search results - page 18 / 24
» Towards Automated Synthesis of Data Mining Programs
Sort
View
103
Voted
MICRO
2007
IEEE
184views Hardware» more  MICRO 2007»
15 years 6 months ago
Data Access Partitioning for Fine-grain Parallelism on Multicore Architectures
The recent design shift towards multicore processors has spawned a significant amount of research in the area of program parallelization. The future abundance of cores on a singl...
Michael L. Chu, Rajiv A. Ravindran, Scott A. Mahlk...
81
Voted
CSFW
2010
IEEE
15 years 3 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko
CADE
2007
Springer
15 years 12 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
15 years 5 months ago
Parameter sweeps for exploring GP parameters
This paper describes our procedure and a software application for conducting large parameter sweep experiments in genetic and evolutionary computation research. Both procedure and...
Michael E. Samples, Jason M. Daida, Matthew J. Byo...
PETRA
2009
ACM
15 years 6 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...