1933 search results - page 246 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
116
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
152
click to vote
IDA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a Bayesian treatment of non-negative matrix factorization (NMF), based on a normal likelihood and exponential priors, and derive an efficient Gibbs sampler to ...
125
click to vote
IEAAIE
2005
Springer
15 years 9 months ago
2005
Springer
The preservation of common components has been recently isolated as a beneficial feature of genetic algorithms. One interpretation of this benefit is that the preservation of commo...
158
Voted
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...
136
Voted
ICDCS
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper discusses wireless channel allocation problem for data dissemination in mobile computing systems. Methods for accessing data through broadcast and on-demand channels ar...