Sciweavers

1086 search results - page 196 / 218
» Subspace Analysis Using Random Mixture Models
Sort
View
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 8 months ago
Interference and Outage in Clustered Wireless Ad Hoc Networks
—In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, th...
Radha Krishna Ganti, Martin Haenggi
ICCV
1999
IEEE
14 years 10 months ago
Dynamic Feature Ordering for Efficient Registration
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
Tat-Jen Cham, James M. Rehg
ICCV
2005
IEEE
14 years 2 months ago
On the Spatial Statistics of Optical Flow
We develop a method for learning the spatial statistics of optical flow fields from a novel training database. Training flow fields are constructed using range images of natur...
Stefan Roth, Michael J. Black
ADHOC
2006
97views more  ADHOC 2006»
13 years 8 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 8 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin