Sciweavers

291 search results - page 55 / 59
» The Bidimensionality Theory and Its Algorithmic Applications
Sort
View
POPL
2008
ACM
14 years 9 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
TCSV
2008
156views more  TCSV 2008»
13 years 8 months ago
Robust Lossless Image Data Hiding Designed for Semi-Fragile Image Authentication
Recently, among various data hiding techniques, a new subset, lossless data hiding, has received increasing interest. Most of the existing lossless data hiding algorithms are, howe...
Zhicheng Ni, Yun Q. Shi, Nirwan Ansari, Wei Su, Qi...
JSAC
2007
97views more  JSAC 2007»
13 years 8 months ago
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
Mea Wang, Baochun Li
JMLR
2002
111views more  JMLR 2002»
13 years 8 months ago
The Learning-Curve Sampling Method Applied to Model-Based Clustering
We examine the learning-curve sampling method, an approach for applying machinelearning algorithms to large data sets. The approach is based on the observation that the computatio...
Christopher Meek, Bo Thiesson, David Heckerman
DAC
2004
ACM
14 years 9 months ago
An analytical approach for dynamic range estimation
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
Bin Wu, Jianwen Zhu, Farid N. Najm