Sciweavers

5115 search results - page 994 / 1023
» On Randomized Lanczos Algorithms
Sort
View
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 3 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
MIR
2004
ACM
171views Multimedia» more  MIR 2004»
14 years 3 months ago
Mean version space: a new active learning method for content-based image retrieval
In content-based image retrieval, relevance feedback has been introduced to narrow the gap between low-level image feature and high-level semantic concept. Furthermore, to speed u...
Jingrui He, Hanghang Tong, Mingjing Li, HongJiang ...
MMSEC
2004
ACM
137views Multimedia» more  MMSEC 2004»
14 years 3 months ago
Perturbed quantization steganography with wet paper codes
In this paper, we introduce a new approach to passive-warden steganography in which the sender embeds the secret message into a certain subset of the cover object without having t...
Jessica J. Fridrich, Miroslav Goljan, David Soukal
SASN
2004
ACM
14 years 3 months ago
Source-location privacy in energy-constrained sensor network routing
As sensor-driven applications become increasingly integrated into our lives, issues related to sensor privacy will become increasingly important. Although many privacy-related iss...
Celal Ozturk, Yanyong Zhang, Wade Trappe
EUROCRYPT
2004
Springer
14 years 3 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai