Sciweavers

2610 search results - page 320 / 522
» Computational Probabilistic Non-interference
Sort
View
WDAG
2007
Springer
92views Algorithms» more  WDAG 2007»
15 years 9 months ago
Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
Abstract. Distributed computing must adapt its techniques to networks of mobile agents. Indeed, we are facing new problems like the small size of memory and the lack of computation...
Joffroy Beauquier, Julien Clement, Stéphane...
143
Voted
SAC
2006
ACM
15 years 9 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
ICPR
2010
IEEE
15 years 9 months ago
Sparse Coding of Linear Dynamical Systems with an Application to Dynamic Texture Recognition
Given a sequence of observable features of a linear dynamical system (LDS), we propose the problem of finding a representation of the LDS which is sparse in terms of a given dict...
Bernard Ghanem, Narendra Ahuja
ICCV
2005
IEEE
15 years 9 months ago
Priors for People Tracking from Small Training Sets
We advocate the use of Scaled Gaussian Process Latent Variable Models (SGPLVM) to learn prior models of 3D human pose for 3D people tracking. The SGPLVM simultaneously optimizes a...
Raquel Urtasun, David J. Fleet, Aaron Hertzmann, P...
NCA
2005
IEEE
15 years 9 months ago
Slingshot: Time-Critical Multicast for Clustered Applications
Datacenters are complex environments consisting of thousands of failure-prone commodity components connected by fast, high-capacity interconnects. The software running on such dat...
Mahesh Balakrishnan, Stefan Pleisch, Ken Birman