1327 search results - page 216 / 266 » Path following algorithm for the graph matching problem |
183
click to vote
MFCS
2010
Springer
15 years 4 days ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
113
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
99
Voted
WEBDB
2010
Springer
15 years 6 months ago
2010
Springer
Wikipedia has become an important source of information which is growing very rapidly. However, the existing infrastructure for querying this information is limited and often igno...
111
click to vote
SIROCCO
2004
15 years 3 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
102
click to vote
TCOM
2010
14 years 8 months ago
2010
Abstract--This paper considers the problem of optimal subcarrier allocation in OFDMA systems to achieve the minimum outage probability while guaranteeing fairness. The optimal subc...