Sciweavers

1813 search results - page 20 / 363
» Instance Pruning Techniques
Sort
View
FSTTCS
2008
Springer
15 years 26 days ago
Pruning 2-Connected Graphs
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
Chandra Chekuri, Nitish Korula
FASE
2010
Springer
15 years 6 months ago
Evaluating Ordering Heuristics for Dynamic Partial-Order Reduction Techniques
Actor programs consist of a number of concurrent objects called actors, which communicate by exchanging messages. Nondeterminism in actors results from the different possible orde...
Steven Lauterburg, Rajesh K. Karmani, Darko Marino...
PAKDD
2010
ACM
215views Data Mining» more  PAKDD 2010»
15 years 1 months ago
Mining Closed Episodes from Event Sequences Efficiently
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...
Wenzhi Zhou, Hongyan Liu, Hong Cheng
MM
2006
ACM
152views Multimedia» more  MM 2006»
15 years 5 months ago
Local image representations using pruned salient points with applications to CBIR
Salient points are locations in an image where there is a significant variation with respect to a chosen image feature. Since the set of salient points in an image capture import...
Hui Zhang, Rouhollah Rahmani, Sharath R. Cholleti,...
DMIN
2007
91views Data Mining» more  DMIN 2007»
15 years 1 months ago
Instance Ranking using Ensemble Spread
- This paper investigates a technique for predicting ensemble uncertainty originally proposed in the weather forecasting domain. The overall purpose is to find out if the technique...
Rikard König, Ulf Johansson, Lars Niklasson