Sciweavers

1629 search results - page 244 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
ASAP
1997
IEEE
155views Hardware» more  ASAP 1997»
15 years 1 months ago
An Approach for Quantitative Analysis of Application-Specific Dataflow Architectures
In this paper we present an approach for quantitative analysis of application-specific dataflow architectures. The approach allows the designer to rate design alternatives in a qu...
Bart Kienhuis, Ed F. Deprettere, Kees A. Vissers, ...
INFOCOM
2010
IEEE
14 years 7 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
IJCNN
2006
IEEE
15 years 3 months ago
Design of Optimal PI Controllers for Doubly Fed Induction Generators Driven by Wind Turbines Using Particle Swarm Optimization
– When subjected to transient disturbances in the power grid, the variable frequency converter (VFC) is the most sensitive part in the variable-speed wind turbine generator syste...
Wei Qiao, Ganesh K. Venayagamoorthy, Ronald G. Har...
DAC
2005
ACM
15 years 11 months ago
DTM: dynamic tone mapping for backlight scaling
- This paper proposes an approach for pixel transformation of the displayed image to increase the potential energy saving of the backlight scaling method. The proposed approach tak...
Ali Iranli, Massoud Pedram
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
15 years 10 months ago
Estimating the confidence of conditional functional dependencies
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
Graham Cormode, Lukasz Golab, Flip Korn, Andrew Mc...