Sciweavers

968 search results - page 86 / 194
» Evaluating Benchmark Subsetting Approaches
Sort
View
SIGSOFT
2007
ACM
14 years 11 months ago
Recommending random walks
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev...
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
14 years 10 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
EDBT
2006
ACM
169views Database» more  EDBT 2006»
14 years 10 months ago
Feedback-Driven Structural Query Expansion for Ranked Retrieval of XML Data
Relevance Feedback is an important way to enhance retrieval quality by integrating relevance information provided by a user. In XML retrieval, feedback engines usually generate an ...
Ralf Schenkel, Martin Theobald
ATVA
2009
Springer
173views Hardware» more  ATVA 2009»
14 years 4 months ago
Solving Parity Games in Practice
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
Oliver Friedmann, Martin Lange
GBRPR
2009
Springer
14 years 4 months ago
Matching Hierarchies of Deformable Shapes
This paper presents an approach to matching parts of deformable shapes. Multiscale salient parts of the two shapes are first identified. Then, these parts are matched if their im...
Nadia Payet, Sinisa Todorovic