Sciweavers

1612 search results - page 267 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 1 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
FOCS
2004
IEEE
15 years 1 months ago
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
Brian C. Dean, Michel X. Goemans, Jan Vondrá...
AAAI
2008
15 years 3 days ago
Dimension Amnesic Pyramid Match Kernel
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
Yi Liu, Xulei Wang, Hongbin Zha
3DICA
2000
14 years 11 months ago
Automatic Reconstruction of Large 3D Models of Real Environments from Unregistered Data-sets
Towards photo-realistic 3D scene reconstruction from range and color images, we present a statistical technique for multimodal image registration. Statistical tools are employed t...
Faysal Boughorbel, David L. Page, Mongi A. Abidi
ATAL
2010
Springer
14 years 11 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...