Sciweavers

400 search results - page 69 / 80
» Hard Problem Generation for MKP
Sort
View
75
Voted
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
15 years 6 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
EUROSYS
2009
ACM
15 years 6 months ago
Pointless tainting?: evaluating the practicality of pointer tainting
This paper evaluates pointer tainting, an incarnation of Dynamic Information Flow Tracking (DIFT), which has recently become an important technique in system security. Pointer tai...
Asia Slowinska, Herbert Bos
BPM
2009
Springer
340views Business» more  BPM 2009»
15 years 4 months ago
Abstractions in Process Mining: A Taxonomy of Patterns
ions in Process Mining: A Taxonomy of Patterns R.P. Jagadeesh Chandra Bose1,2 and Wil M.P. van der Aalst1 1 Department of Mathematics and Computer Science, University of Technology...
R. P. Jagadeesh Chandra Bose, Wil M. P. van der Aa...
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
15 years 4 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ï¬...
Marek Lipczak, Evangelos E. Milios
SSS
2009
Springer
195views Control Systems» more  SSS 2009»
15 years 4 months ago
Anonymous Transactions in Computer Networks
Abstract. We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user anonymous authentication in distributed networks such as...
Shlomi Dolev, Marina Kopeetsky