7129 search results - page 714 / 1426 » Approximation Algorithms for Treewidth |
200
click to vote
CG
2002
Springer
15 years 7 months ago
2002
Springer
We present new algorithms for the robust transmission of geometric data sets, i.e. transmission which allows the receiver to recover (an approximation of) the original geometric o...
178
click to vote
IOR
2010
15 years 5 months ago
2010
We present exchange formulas that allow to express the stationary distribution of a continuous Markov chain with denumerable state-space having generator matrix Q∗ through a con...
180
click to vote
NAACL
2010
15 years 5 months ago
2010
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
182
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
We provide two compressive sensing (CS) recovery algorithms based on iterative hard-thresholding. The algorithms, collectively dubbed as algebraic pursuits (ALPS), exploit the res...
394
click to vote
AAIM
2011
Springer
14 years 10 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...