Sciweavers

165 search results - page 18 / 33
» From an approximate to an exact absolute polynomial factoriz...
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
COCOA
2008
Springer
13 years 9 months ago
On Recovering Syntenic Blocks from Comparative Maps
A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in either positive or negative form. A strip (syntenic b...
Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu
IS
2006
13 years 7 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...
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
14 years 4 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
IPL
2011
73views more  IPL 2011»
13 years 2 months ago
Maximum subset intersection
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
Raphaël Clifford, Alexandru Popa