16188 search results - page 2778 / 3238 » The Optimal PAC Algorithm |
207
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
183
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
In recent years a considerable amount of work in graphics and geometric optimization used tools based on the Laplace-Beltrami operator on a surface. The applications of the Laplac...
177
click to vote
SIROCCO
2010
15 years 8 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
207
click to vote
DBSEC
2006
15 years 8 months ago
2006
Abstract. Attack graph is important in defending against well-orchestrated network intrusions. However, the current analysis of attack graphs requires an algorithm to be developed ...
212
click to vote
NIPS
2001
15 years 8 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...