223 search results - page 40 / 45 » On Computing Longest Paths in Small Graph Classes |
195
Voted
MOBIHOC
2004
ACM
16 years 6 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
197
Voted
COCOON
2003
Springer
15 years 12 months ago
2003
Springer
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
184
Voted
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
202
Voted
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
199
Voted
EUROCAST
2007
Springer
15 years 10 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...