Sciweavers

1536 search results - page 32 / 308
» Approximately Dominating Representatives
Sort
View
HPDC
2008
IEEE
13 years 7 months ago
Code coverage, performance approximation and automatic recognition of idioms in scientific applications
Basic data flow patterns which we call idioms, such as stream, transpose, reduction, random access and stencil, are common in scientific numerical applications. We hypothesize tha...
Jiahua He, Allan Snavely, Rob F. Van der Wijngaart...
DCC
2004
IEEE
14 years 7 months ago
Predicting Wavelet Coefficients Over Edges Using Estimates Based on Nonlinear Approximants
It is well-known that wavelet transforms provide sparse decompositions over many types of image regions but not over image singularities/edges that manifest themselves along curve...
Onur G. Guleryuz
CCCG
2010
13 years 9 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
SIGCOMM
2006
ACM
14 years 1 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
EMO
2006
Springer
158views Optimization» more  EMO 2006»
13 years 11 months ago
The Hypervolume Indicator Revisited: On the Design of Pareto-compliant Indicators Via Weighted Integration
The design of quality measures for approximations of the Pareto-optimal set is of high importance not only for the performance assessment, but also for the construction of multiobj...
Eckart Zitzler, Dimo Brockhoff, Lothar Thiele