Sciweavers

2434 search results - page 232 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
JCO
1998
102views more  JCO 1998»
15 years 4 months ago
Facility Location with Dynamic Distance Functions
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...
Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram...
VEE
2006
ACM
142views Virtualization» more  VEE 2006»
15 years 10 months ago
Secure and practical defense against code-injection attacks using software dynamic translation
One of the most common forms of security attacks involves exploiting a vulnerability to inject malicious code into an executing application and then cause the injected code to be ...
Wei Hu, Jason Hiser, Daniel Williams, Adrian Filip...
TIT
2008
90views more  TIT 2008»
15 years 4 months ago
Scanning and Sequential Decision Making for Multidimensional Data - Part II: The Noisy Case
We consider the problem of sequential decision making for random fields corrupted by noise. In this scenario, the decision maker observes a noisy version of the data, yet judged wi...
Asaf Cohen, Tsachy Weissman, Neri Merhav
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 8 months ago
Metastability of Logit Dynamics for Coordination Games
Logit Dynamics [Blume, Games and Economic Behavior, 1993] is a randomized best response dynamics for strategic games: at every time step a player is selected uniformly at random a...
Vincenzo Auletta, Diodato Ferraioli, Francesco Pas...
KDD
2010
ACM
195views Data Mining» more  KDD 2010»
15 years 8 months ago
Universal multi-dimensional scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...