Sciweavers

563 search results - page 71 / 113
» constraints 2002
Sort
View
DKE
2002
107views more  DKE 2002»
13 years 7 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
JCSS
2002
114views more  JCSS 2002»
13 years 7 months ago
Polymorphic Type Inference for the Relational Algebra
A database programming language is a programming language extended with database operations. In this paper we extend a core functional language with explicitly labeled tuples and ...
Jan Van den Bussche, Emmanuel Waller
MOR
2002
102views more  MOR 2002»
13 years 7 months ago
Facets of the Complementarity Knapsack Polytope
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
Ismael R. de Farias Jr., Ellis L. Johnson, George ...
SP
2002
IEEE
128views Security Privacy» more  SP 2002»
13 years 7 months ago
Fitting hidden Markov models to psychological data
Markov models have been used extensively in psychology of learning. Applications of hidden Markov models are rare however. This is partially due to the fact that comprehensive stat...
Ingmar Visser, Maartje E. J. Raijmakers, Peter C. ...
TCAD
2002
73views more  TCAD 2002»
13 years 7 months ago
A timing-constrained simultaneous global routing algorithm
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar