16188 search results - page 368 / 3238 » The Optimal PAC Algorithm |
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
149
click to vote
SIAMSC
2010
15 years 1 months ago
2010
In this article we are interested in the derivation of efficient domain decomposition methods for the viscous primitive equations of the ocean. We consider the rotating 3d incompre...
149
Voted
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper presents an efficient implementation of a robust adaptive beamforming algorithm based on convex optimization for applications in the processing-constrained environment...
185
click to vote
STOC
2009
ACM
16 years 7 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 ...
158
click to vote
ESA
1993
Springer
15 years 11 months ago
1993
Springer
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...