Sciweavers

336 search results - page 41 / 68
» On the Optimality of Gluing over Scales
Sort
View
CF
2010
ACM
14 years 18 days ago
Enabling a highly-scalable global address space model for petascale computing
Over the past decade, the trajectory to the petascale has been built on increased complexity and scale of the underlying parallel architectures. Meanwhile, software developers hav...
Vinod Tipparaju, Edoardo Aprà, Weikuan Yu, ...
CHES
2000
Springer
167views Cryptology» more  CHES 2000»
13 years 12 months ago
A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
Gerardo Orlando, Christof Paar
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 7 months ago
On the Convexity of Latent Social Network Inference
In many real-world scenarios, it is nearly impossible to collect explicit social network data. In such cases, whole networks must be inferred from underlying observations. Here, w...
Seth A. Myers, Jure Leskovec
EOR
2010
149views more  EOR 2010»
13 years 7 months ago
Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
Outer linearization methods for two-stage stochastic linear programs with recourse, such as the L-shaped algorithm, generally apply a single optimality cut on the nonlinear object...
Svyatoslav Trukhanov, Lewis Ntaimo, Andrew Schaefe...
JSAC
2006
104views more  JSAC 2006»
13 years 7 months ago
Queue Proportional Scheduling via Geometric Programming in Fading Broadcast Channels
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is presented via geometric programming (GP). QPS finds a data ...
Kibeom Seong, Ravi Narasimhan, John M. Cioffi