Sciweavers

110 search results - page 3 / 22
» An L-like model containing very large cardinals
Sort
View
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
14 years 2 months ago
Compressing Relations and Indexes
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft
CONSTRAINTS
2011
13 years 1 months ago
CP and IP approaches to cancer radiotherapy delivery optimization
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
Davaatseren Baatar, Natashia Boland, Sebastian Bra...
FOCS
2008
IEEE
14 years 4 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
MONET
2002
85views more  MONET 2002»
13 years 9 months ago
Bringing the Web to the Network Edge: Large Caches and Satellite Distribution
In this paper we discuss the performance of a document distribution model that interconnects Web caches through a satellite channel. During recent years Web caching has emerged as...
Pablo Rodriguez, Ernst Biersack
SSDBM
2007
IEEE
121views Database» more  SSDBM 2007»
14 years 4 months ago
Cost-based Optimization of Complex Scientific Queries
High energy physics scientists analyze large amounts of data looking for interesting events when particles collide. These analyses are easily expressed using complex queries that ...
Ruslan Fomkin, Tore Risch