Sciweavers

2157 search results - page 85 / 432
» Optimal Fast Hashing
Sort
View
122
Voted
AUTOMATICA
2007
80views more  AUTOMATICA 2007»
15 years 4 months ago
Fast, large-scale model predictive control by partial enumeration
Partial enumeration (PE) is presented as a method for treating large, linear model predictive control applications that are out of reach with available MPC methods. PE uses both a...
Gabriele Pannocchia, James B. Rawlings, Stephen J....
VC
2011
150views more  VC 2011»
14 years 11 months ago
Weak-perspective structure from motion by fast alternation
Abstract This paper addresses the problem of moving object reconstruction. Several methods have been published in the past 20 years including stereo reconstruction as well as multi...
Levente Hajder, Ákos Pernek, Csaba Kaz&oacu...
144
Voted
TWC
2010
14 years 10 months ago
Fast algorithms for joint power control and scheduling in wireless networks
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus-noise rat...
Liqun Fu, Soung Chang Liew, Jianwei Huang
144
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
Scheduling in mapreduce-like systems for fast completion time
Abstract—Large-scale data processing needs of enterprises today are primarily met with distributed and parallel computing in data centers. MapReduce has emerged as an important p...
Hyunseok Chang, Murali S. Kodialam, Ramana Rao Kom...
FOCS
1998
IEEE
15 years 8 months ago
Towards an Optimal Bit-Reversal Permutation Program
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
Larry Carter, Kang Su Gatlin