Sciweavers

7129 search results - page 280 / 1426
» Approximation Algorithms for Treewidth
Sort
View
CISS
2008
IEEE
15 years 11 months ago
Distributed processing in frames for sparse approximation
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
Christopher J. Rozell
EGH
2007
Springer
15 years 10 months ago
Exact and error-bounded approximate color buffer compression and decompression
In this paper, we first present a survey of existing color buffer compression algorithms. After that, we introduce a new scheme based on an exactly reversible color transform, si...
Jim Rasmusson, Jon Hasselgren, Tomas Akenine-M&oum...
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
15 years 10 months ago
Symbolic Test Selection Based on Approximate Analysis
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu,...
DMSN
2004
ACM
15 years 10 months ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
PG
1999
IEEE
15 years 8 months ago
Mesh Approximation Using a Volume-Based Metric
In this paper we introduce a mesh approximation method that uses a volume-based metric. After a geometric simplification, we minimize the volume between the simplified mesh and th...
Pierre Alliez, Nathalie Laurent, Henri Sanson, Fra...