3958 search results - page 485 / 792 » Dynamic Graph Algorithms with Applications |
170
click to vote
UAI
2008
15 years 8 months ago
2008
Many algorithms and applications involve repeatedly solving variations of the same inference problem; for example we may want to introduce new evidence to the model or perform upd...
198
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
176
Voted
CAP
2010
15 years 1 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
176
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
174
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...