Sciweavers

587 search results - page 6 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
COLING
2010
13 years 2 months ago
Comparison of different algebras for inducing the temporal structure of texts
This paper investigates the impact of using different temporal algebras for learning temporal relations between events. Specifically, we compare three intervalbased algebras: Alle...
Pascal Denis, Philippe Muller
SIGMOD
1997
ACM
113views Database» more  SIGMOD 1997»
13 years 11 months ago
Size Separation Spatial Join
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
Nick Koudas, Kenneth C. Sevcik
EJC
2010
13 years 7 months ago
Descent polynomials for permutations with bounded drop size
Abstract. Motivated by juggling sequences and bubble sort, we examine permutations on the set {1, 2, . . . , n} with d descents and maximum drop size k. We give explicit formulas f...
Fan R. K. Chung, Anders Claesson, Mark Dukes, Rona...
VLDB
2006
ACM
147views Database» more  VLDB 2006»
14 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
EOR
2008
95views more  EOR 2008»
13 years 7 months ago
Augmenting the lot sizing order quantity when demand is probabilistic
In this paper we consider a single item, discrete time, lot sizing situation where demand is random and its parameters (e.g., mean and standard deviation) can change with time. Fo...
I. Nyoman Pujawan, Edward A. Silver