Sciweavers

692 search results - page 33 / 139
» BDD minimization for approximate computing
Sort
View
IFIPTCS
2010
14 years 8 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 3 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
ESANN
2006
14 years 12 months ago
Determination of the Mahalanobis matrix using nonparametric noise estimations
In this paper, the problem of an optimal transformation of the input space for function approximation problems is addressed. The transformation is defined determining the Mahalanob...
Amaury Lendasse, Francesco Corona, Jin Hao, Nima R...
IS
2006
14 years 10 months ago
Processing approximate aggregate queries in wireless sensor networks
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
JAIR
1998
81views more  JAIR 1998»
14 years 10 months ago
Computational Aspects of Reordering Plans
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
Christer Bäckström