Sciweavers

2849 search results - page 236 / 570
» As We Should Have Thought
Sort
View
DAM
2007
100views more  DAM 2007»
15 years 6 months ago
Partially ordered knapsack and applications to scheduling
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
Stavros G. Kolliopoulos, George Steiner
TKDE
1998
163views more  TKDE 1998»
15 years 6 months ago
A Highly Effective Partition Selection Policy for Object Database Garbage Collection
—We investigate methods to improve the performance of algorithms for automatic storage reclamation of object databases. These algorithms are based on a technique called partition...
Jonathan E. Cook, Alexander L. Wolf, Benjamin G. Z...
PVLDB
2008
126views more  PVLDB 2008»
15 years 6 months ago
Dwarfs in the rearview mirror: how big are they really?
Online-Analytical Processing (OLAP) has been a field of competing technologies for the past ten years. One of the still unsolved challenges of OLAP is how to provide quick respons...
Jens Dittrich, Lukas Blunschi, Marcos Antonio Vaz ...
DRR
2009
15 years 4 months ago
Using synthetic data safely in classification
When is it safe to use synthetic data in supervised classification? Trainable classifier technologies require large representative training sets consisting of samples labeled with...
Jean Nonnemaker, Henry Baird
HOTNETS
2010
15 years 1 months ago
A case for information-bound referencing
Links and content references form the foundation of the way that users interact today. Unfortunately, the links used today (URLs) are fragile since they tightly specify a protocol...
Ashok Anand, Aditya Akella, Vyas Sekar, Srinivasan...