Sciweavers

383 search results - page 21 / 77
» OLAP Dimension Constraints
Sort
View
111
Voted
MP
2010
99views more  MP 2010»
15 years 8 days ago
Separation, dimension, and facet algorithms for node flow polyhedra
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...
106
Voted
NOSSDAV
2001
Springer
15 years 6 months ago
Dimensioning server access bandwidth and multicast routing in overlay networks
Application-level multicast is a new mechanism for enabling multicast in the Internet. Driven by the fast growth of network audio/video streams, application-level multicast has be...
Sherlia Shi, Jonathan S. Turner, Marcel Waldvogel
ICCAD
2000
IEEE
109views Hardware» more  ICCAD 2000»
15 years 6 months ago
General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
Hongbing Fan, Jiping Liu, Yu-Liang Wu
137
Voted
JSAC
2007
125views more  JSAC 2007»
15 years 1 months ago
Network Dimensioning under Scheduled and Random Lightpath Demands in All-Optical WDM Networks
— In WDM optical networks connection requests can be classified into three different types: Permanent Lightpath Demands (PLDs), Scheduled Lightpath Demands (SLDs), and Random Li...
Maurice Gagnaire, Mohamed Koubàa, Nicolas P...
ICDE
2003
IEEE
96views Database» more  ICDE 2003»
16 years 3 months ago
Pushing Aggregate Constraints by Divide-and-Approximate
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong...