Sciweavers

679 search results - page 122 / 136
» codes 2002
Sort
View
TMM
2002
109views more  TMM 2002»
14 years 9 months ago
Smart rebinning for the compression of concentric mosaic
The concentric mosaic offers a quick solution to construct a virtual copy of a real environment, and to navigate in that virtual environment. However, the huge amount of data asso...
Yunnan Wu, Cha Zhang, Jin Li
TOCS
2002
70views more  TOCS 2002»
14 years 9 months ago
Secure program partitioning
This paper presents secure program partitioning, a language-based technique for protecting confidential data during computation in distributed systems containing mutually untruste...
Steve Zdancewic, Lantian Zheng, Nathaniel Nystrom,...
TON
2002
175views more  TON 2002»
14 years 9 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
VLSISP
2002
103views more  VLSISP 2002»
14 years 9 months ago
A New Class of Efficient Block-Iterative Interference Cancellation Techniques for Digital Communication Receivers
A new and efficient class of nonlinear receivers is introduced for digital communication systems. These "iterated-decision" receivers use optimized multipass algorithms t...
Albert M. Chan, Gregory W. Wornell
JMLR
2010
111views more  JMLR 2010»
14 years 4 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...