Sciweavers

7015 search results - page 262 / 1403
» Approximation algorithms for co-clustering
Sort
View
EDBT
2002
ACM
129views Database» more  EDBT 2002»
16 years 6 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
CISS
2008
IEEE
16 years 1 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
16 years 22 days 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»
16 years 1 days 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
16 years 6 hour 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