Sciweavers

2621 search results - page 402 / 525
» Near orders and codes
Sort
View
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
16 years 7 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
ICFP
2007
ACM
16 years 6 months ago
User-friendly functional programming for web mashups
MashMaker is a web-based tool that makes it easy for a normal user to create web mashups by browsing around, without needing to type, or plan in advance what they want to do. Like...
Robert Ennals, David Gay
DCC
2010
IEEE
16 years 1 months ago
Lossless Data Compression via Substring Enumeration
We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order...
Danny Dubé, Vincent Beaudoin
ICC
2008
IEEE
175views Communications» more  ICC 2008»
16 years 28 days ago
Routing in Cooperative Wireless Networks with Mutual-Information Accumulation
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
Stark C. Draper, Lingjia Liu, Andreas F. Molisch, ...
VTC
2008
IEEE
127views Communications» more  VTC 2008»
16 years 26 days ago
A Low-Complexity Precoder for Large Multiuser MISO Systems
—In this paper, we consider the problem of precoding in large multiuser MISO systems, where by ‘large’ we mean i) large number of transmit antennas (Nt) at the base station o...
Saif K. Mohammed, Ananthanarayanan Chockalingam, B...