3874 search results - page 585 / 775 » Approximation Algorithms for k-hurdle Problems |
143
click to vote
TIP
1998
15 years 4 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
133
click to vote
TKDE
2010
15 years 2 months ago
2010
—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elemen...
139
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
156
click to vote
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
137
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...