2137 search results - page 349 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
128
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
132
click to vote
IJWIN
2006
15 years 2 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
131
Voted
IAT
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract—Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect of these ...
136
Voted
ML
2002
ACM
15 years 2 months ago
2002
ACM
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
115
click to vote
IACR
2011
14 years 2 months ago
2011
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...