Sciweavers

1236 search results - page 91 / 248
» fast 2010
Sort
View
145
Voted
CASES
2010
ACM
15 years 8 days ago
Optimizing energy to minimize errors in dataflow graphs using approximate adders
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna ...
ICALP
2010
Springer
15 years 5 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 3 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts
122
Voted
TELSYS
2010
122views more  TELSYS 2010»
15 years 1 months ago
Transmission scheduling for multi-homed transport protocols with network failure tolerance
In heterogeneous network environments, the network connections of a multi-homed device may have significant bandwidth differential. For a multihomed transmission protocol designed ...
Yuansong Qiao, Enda Fallon, John Murphy, Liam Murp...
132
Voted
ICDM
2010
IEEE
105views Data Mining» more  ICDM 2010»
15 years 1 months ago
On the Vulnerability of Large Graphs
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
Hanghang Tong, B. Aditya Prakash, Charalampos E. T...