2356 search results - page 33 / 472 » Characterizations of postman sets |
DOLAP
1999
ACM
15 years 4 months ago
1999
ACM
Recently numerous proposals for modelling and querying Multidimensional Databases (MDDB) are proposed. Among the still open problems there is a rigorous classification of the diff...
COCO
1992
Springer
15 years 3 months ago
1992
Springer
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...
106
click to vote
TSDM
2000
15 years 3 months ago
2000
The novel Time Series Data Mining (TSDM) framework is applied to analyzing financial time series. The TSDM framework adapts and innovates data mining concepts to analyzing time ser...
UAI
2004
15 years 1 months ago
2004
We characterize probabilities in Bayesian networks in terms of algebraic expressions called quasi-probabilities. These are arrived at by casting Bayesian networks as noisy AND-OR-...
ESA
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...