Sciweavers

1257 search results - page 57 / 252
» A generalization of Euler's constant
Sort
View
CSFW
2011
IEEE
12 years 8 months ago
The Complexity of Quantitative Information Flow Problems
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...
MOBIHOC
2008
ACM
14 years 8 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
13 years 7 months ago
Visual odometry priors for robust EKF-SLAM
— One of the main drawbacks of standard visual EKF-SLAM techniques is the assumption of a general camera motion model. Usually this motion model has been implemented in the liter...
Pablo Fernández Alcantarilla, Luis Miguel B...
TC
2011
13 years 3 months ago
Performing Arithmetic Operations on Round-to-Nearest Representations
—During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number repre...
Peter Kornerup, Jean-Michel Muller, Adrien Panhale...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 9 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf