Sciweavers

16159 search results - page 2913 / 3232
» Parallel computing with CUDA
Sort
View
196
Voted
FCT
2007
Springer
15 years 10 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
FOCS
2007
IEEE
15 years 10 months ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar
DSD
2009
IEEE
147views Hardware» more  DSD 2009»
15 years 10 months ago
A High Performance Hardware Architecture for One Bit Transform Based Motion Estimation
Motion Estimation (ME) is the most computationally intensive part of video compression and video enhancement systems. One bit transform (1BT) based ME algorithms have low computat...
Abdulkadir Akin, Yigit Dogan, Ilker Hamzaoglu
WCNC
2010
IEEE
15 years 10 months ago
Scalable Mismatch Compensation for Time-Interleaved A/D Converters in OFDM Reception
Abstract—Realization of all-digital baseband receiver processing for multi-Gigabit communication requires analog-to-digital converters(ADCs) of sufficient rate and output resolu...
Sandeep Ponnuru, Upamanyu Madhow
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
15 years 10 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
« Prev « First page 2913 / 3232 Last » Next »