Sciweavers

8647 search results - page 607 / 1730
» The Container Selection Problem
Sort
View
JMLR
2010
187views more  JMLR 2010»
15 years 1 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
AAAI
2011
14 years 7 months ago
Dynamic Resource Allocation in Conservation Planning
Consider the problem of protecting endangered species by selecting patches of land to be used for conservation purposes. Typically, the availability of patches changes over time, ...
Daniel Golovin, Andreas Krause, Beth Gardner, Sara...
VLDB
2006
ACM
147views Database» more  VLDB 2006»
16 years 7 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
PODS
2003
ACM
113views Database» more  PODS 2003»
16 years 7 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
SODA
2010
ACM
178views Algorithms» more  SODA 2010»
16 years 4 months ago
Tree Embeddings for Two-Edge-Connected Network Design
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi