648 search results - page 47 / 130 » Simple Algorithms for a Weighted Interval Selection Problem |
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Feature selection plays a fundamental role in many pattern
recognition problems. However, most efforts have been
focused on the supervised scenario, while unsupervised feature
s...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
SODA
1997
ACM
13 years 9 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
DEXA
2008
Springer
13 years 9 months ago
2008
Springer
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of ...