Sciweavers

5606 search results - page 407 / 1122
» Randomization Techniques for Graphs.
Sort
View
DCC
2008
IEEE
16 years 6 months ago
Compressive-Projection Principal Component Analysis for the Compression of Hyperspectral Signatures
A method is proposed for the compression of hyperspectral signature vectors on severely resourceconstrained encoding platforms. The proposed technique, compressive-projection prin...
James E. Fowler
CVPR
2010
IEEE
16 years 3 months ago
Segmentation of Building Facades Using Procedural Shape Priors
In this paper we propose a novel approach to the perceptual interpretation of building facades that combines shape grammars, supervised classification and random walks. Procedural...
Olivier Teboul, Loic Simon, Panagiotis Koutsouraki...
CIMCA
2006
IEEE
16 years 23 days ago
Model-driven Walks for Resource Discovery in Peer-to-Peer Networks
In this paper, a distributed and adaptive approach for resource discovery in peer-to-peer networks is presented. This approach is based on the mobile agent paradigm and the random...
Mohamed Bakhouya, Jaafar Gaber
JOC
2006
71views more  JOC 2006»
15 years 6 months ago
Private Computation: k-Connected versus 1-Connected Networks
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
Markus Bläser, Andreas Jakoby, Maciej Liskiew...
178
Voted
INFOCOM
2005
IEEE
16 years 9 days ago
Perfect simulation and stationarity of a class of mobility models
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
Jean-Yves Le Boudec, Milan Vojnovic