Sciweavers

13603 search results - page 330 / 2721
» On the Complexity of Computing Treelength
Sort
View
JSAC
2006
157views more  JSAC 2006»
15 years 7 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
CVPR
2007
IEEE
16 years 9 months ago
Statistical Shape Analysis of Multi-Object Complexes
An important goal of statistical shape analysis is the discrimination between populations of objects, exploring group differences in morphology not explained by standard volumetri...
Kevin Gorczowski, Martin Styner, Ja-Yeon Jeong, J....
HPCA
2004
IEEE
16 years 7 months ago
Accurate and Complexity-Effective Spatial Pattern Prediction
Recent research suggests that there are large variations in a cache's spatial usage, both within and across programs. Unfortunately, conventional caches typically employ fixe...
Chi F. Chen, Se-Hyun Yang, Babak Falsafi, Andreas ...
EMSOFT
2007
Springer
16 years 1 months ago
Methods for multi-dimensional robustness optimization in complex embedded systems
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
Arne Hamann, Razvan Racu, Rolf Ernst
PODS
2005
ACM
96views Database» more  PODS 2005»
16 years 1 months ago
Space complexity of hierarchical heavy hitters in multi-dimensional data streams
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
John Hershberger, Nisheeth Shrivastava, Subhash Su...