Sciweavers

1199 search results - page 96 / 240
» Robust inference of trees
Sort
View
ISCAS
1999
IEEE
124views Hardware» more  ISCAS 1999»
15 years 8 months ago
On the robustness of vector set partitioning image coders to bit errors
A vector enhancement of Said and Pearlman's Set Partitioning in Hierarchical Trees (SPIHT) methodology, named VSPIHT, has recently been proposed for embedded wavelet image co...
D. Mukherjee, S. K. Mitra
ICCAD
1997
IEEE
129views Hardware» more  ICCAD 1997»
15 years 8 months ago
A fast and robust exact algorithm for face embedding
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...
Evguenii I. Goldberg, Tiziano Villa, Robert K. Bra...
CN
2006
66views more  CN 2006»
15 years 4 months ago
Secure acknowledgment aggregation and multisignatures with limited robustness
In certain reliable group-oriented and multicast applications, a source needs to securely verify whether all (and if not all, which) intended receivers have received a message. How...
Claude Castelluccia, Stanislaw Jarecki, Jihye Kim,...
INFOCOM
2007
IEEE
15 years 10 months ago
Mutual Anonymous Communications: A New Covert Channel Based on Splitting Tree MAC
—Known covert channel based on splitting algorithms in Medium Access Control (MAC) protocols requires the receiver’s knowledge of the sender’s identity. In this paper we pres...
Zhenghong Wang, Jing Deng, Ruby B. Lee
ICIAP
2009
ACM
15 years 1 months ago
Tree Covering within a Graph Kernel Framework for Shape Classification
Abstract. Shape classification using graphs and skeletons usually involves edition processes in order to reduce the influence of structural noise. However, edition distances can no...
François-Xavier Dupé, Luc Brun