312 search results - page 24 / 63 » Iterative compression and exact algorithms |
135
Voted
MST
2010
15 years 3 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
149
click to vote
CGO
2008
IEEE
15 years 12 months ago
2008
IEEE
This paper describes an algorithm that takes a trace (i.e., a sequence of numbers or vectors of numbers) as input, and from that produces a sequence of loop nests that, when run, ...
159
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
145
click to vote
GRAPHICSINTERFACE
2003
15 years 6 months ago
2003
To apply empty space skipping in texture-based volume rendering, we partition the texture space with a box-growing algorithm. Each sub-texture comprises of neighboring voxels with...
136
click to vote
SDM
2009
SIAM
16 years 2 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...