Sciweavers

2191 search results - page 220 / 439
» Improving the Efficiency of Non-Deterministic Computations
Sort
View
ICDT
2009
ACM
129views Database» more  ICDT 2009»
16 years 7 months ago
Faster join-projects and sparse matrix multiplications
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
Rasmus Resen Amossen, Rasmus Pagh
CHI
2001
ACM
16 years 7 months ago
Accordion summarization for end-game browsing on PDAs and cellular phones
We demonstrate a new browsing technique for devices with small displays such as PDAs or cellular phones. We concentrate on end-game browsing, where the user is close to or on the ...
Orkut Buyukkokten, Hector Garcia-Molina, Andreas P...
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 7 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
DCC
2003
IEEE
16 years 6 months ago
Compression of RADARSAT Data with Block Adaptive Wavelets
: This paper proposes a new algorithm referred to as the Wavelet Packet-based Embedded Block coding (WPEB) scheme for SAR data compression. This algorithm combines the following pr...
Ian G. Cumming, Jing Wang
DCC
2002
IEEE
16 years 6 months ago
Diagnostically Lossless 3D Wavelet Compression for Digital Angiogram Video
A novel method for the compression of angiogram video sequences is presented. The approach is based on the idea that not all of an angiogram image will de diagnostically significa...
David Gibson, Sandra I. Woolley, Michael Spann