540 search results - page 103 / 108 » New bounds on the edge number of a k-map graph |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
ML
2008
ACM
13 years 7 months ago
2008
ACM
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
MOBICOM
2010
ACM
13 years 7 months ago
2010
ACM
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
Peer-to-peer and other decentralized, distributed systems are known to be particularly vulnerable to sybil attacks. In a sybil attack, a malicious user obtains multiple fake ident...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...