Sciweavers

849 search results - page 169 / 170
» Completely Non-malleable Schemes
Sort
View
TIFS
2008
157views more  TIFS 2008»
13 years 6 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
TIT
2008
72views more  TIT 2008»
13 years 6 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
TKDE
2008
153views more  TKDE 2008»
13 years 6 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
TPDS
2008
133views more  TPDS 2008»
13 years 6 months ago
A More Practical Approach for Single-Packet IP Traceback using Packet Logging and Marking
Tracing IP packets back to their origins is an important step in defending the Internet against denial-of-service (DoS) attacks. Two kinds of IP traceback techniques have been prop...
Chao Gong, Kamil Saraç
CANDC
2004
ACM
13 years 6 months ago
The iProClass integrated database for protein functional analysis
Increasingly, scientists have begun to tackle gene functions and other complex regulatory processes by studying organisms at the global scales for various levels of biological org...
Cathy H. Wu, Hongzhan Huang, Anastasia N. Nikolska...