2031 search results - page 299 / 407 » On Tree-Constrained Matchings and Generalizations |
79
Voted
DOLAP
2000
ACM
15 years 2 months ago
2000
ACM
A multidimensional database can be seen as a collection of multidimensional cubes, from which information is usually extracted by aggregation; aggregated data can be calculated ei...
120
click to vote
ALT
1999
Springer
15 years 2 months ago
1999
Springer
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
ISCA
2011
IEEE
14 years 1 months ago
2011
IEEE
Conventional high-performance processors utilize register renaming and complex broadcast-based scheduling logic to steer instructions into a small number of heavily-pipelined exec...
100
click to vote
WIOPT
2011
IEEE
14 years 1 months ago
2011
IEEE
There has been considerable recent work developing a new stochastic network utility maximization framework using Backpressure algorithms, also known as MaxWeight. A key open probl...
113
click to vote
JCAM
2011
14 years 22 days ago
2011
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...