Sciweavers

77 search results - page 2 / 16
» Probabilistic Communication Complexity Over The Reals
Sort
View
ESCIENCE
2006
IEEE
13 years 10 months ago
Communication over a Secured Heterogeneous Grid with the GriddLeS Runtime Environment
Scientific workflows are a powerful programming technique for specifying complex computations using a number of otherwise independent components. When used in a Grid environment, ...
Jagan Kommineni, David Abramson, Jefferson Tan
ICIP
2007
IEEE
13 years 11 months ago
Complexity Control for Real-Time Video Coding
A methodology for complexity scalable video encoding and complexity control within the framework of the H.264/AVC video encoder is presented. To yield good rate-distortion perform...
Emrah Akyol, Debargha Mukherjee, Yuxin Liu
INFOCOM
2003
IEEE
13 years 10 months ago
Opportunistic Fair Scheduling over Multiple Wireless Channels
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
Yonghe Liu, Edward W. Knightly
RTCSA
2003
IEEE
13 years 10 months ago
Introducing Temporal Analyzability Late in the Lifecycle of Complex Real-Time Systems
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by c...
Anders Wall, Johan Andersson, Jonas Neander, Chris...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 5 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes