Sciweavers

5169 search results - page 124 / 1034
» Locality approximation using time
Sort
View
ESORICS
2009
Springer
15 years 11 months ago
Hide and Seek in Time - Robust Covert Timing Channels
Abstract. Covert timing channels aim at transmitting hidden messages by controlling the time between transmissions of consecutive payload packets in overt network communication. Pr...
Yali Liu, Dipak Ghosal, Frederik Armknecht, Ahmad-...
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 5 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
ICPR
2002
IEEE
16 years 6 months ago
Metric-Based Shape Retrieval in Large Databases
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
Thomas B. Sebastian, Benjamin B. Kimia
NECO
1998
121views more  NECO 1998»
15 years 4 months ago
Nonlinear Time-Series Prediction with Missing and Noisy Data
We derive solutions for the problem of missing and noisy data in nonlinear timeseries prediction from a probabilistic point of view. We discuss different approximations to the so...
Volker Tresp, Reimar Hofmann
CISS
2008
IEEE
15 years 11 months ago
Distributed processing in frames for sparse approximation
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
Christopher J. Rozell