Sciweavers

1469 search results - page 142 / 294
» Approximate polynomial decomposition
Sort
View
GLOBECOM
2009
IEEE
14 years 7 months ago
Performance Modeling for Heterogeneous Wireless Networks with Multiservice Overflow Traffic
Performance modeling is important for the purpose of developing efficient dimensioning tools for large complicated networks. But it is difficult to achieve in heterogeneous wireles...
Qian Huang, King-Tim Ko, Villy Bæk Iversen
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
15 years 10 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
FOIKS
2004
Springer
15 years 3 months ago
Query Answering and Containment for Regular Path Queries under Distortions
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
Gösta Grahne, Alex Thomo
DAC
2009
ACM
15 years 11 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
IPPS
2009
IEEE
15 years 4 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...