Sciweavers

593 search results - page 56 / 119
» An approach to benchmarking configuration complexity
Sort
View
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
14 years 9 months ago
Constraint programming for itemset mining
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
Luc De Raedt, Tias Guns, Siegfried Nijssen
IPPS
2007
IEEE
14 years 3 months ago
Using Rewriting Logic to Match Patterns of Instructions from a Compiler Intermediate Form to Coarse-Grained Processing Elements
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarsegrained processing elements (PEs). The method uses a three-addr...
Carlos Morra, João M. P. Cardoso, Jürg...
ICMLA
2008
13 years 10 months ago
Basis Function Construction in Reinforcement Learning Using Cascade-Correlation Learning Architecture
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
Sertan Girgin, Philippe Preux
ECIR
2006
Springer
13 years 10 months ago
Structural Feedback for Keyword-Based XML Retrieval
Keyword-based queries are an important means to retrieve information from XML collections with unknown or complex schemas. Relevance Feedback integrates relevance information provi...
Ralf Schenkel, Martin Theobald
ICASSP
2011
IEEE
13 years 16 days ago
A Bayesian marked point process for object detection. Application to muse hyperspectral data
Marked point processes have received a great attention in the recent years, for their ability to extract objects in large data sets as those obtained in biological studies or hype...
Florent Chatelain, Aude Costard, Olivier J. J. Mic...