3875 search results - page 436 / 775 » Approximation algorithms for the 0-extension problem |
197
click to vote
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
220
click to vote
IPSN
2009
Springer
16 years 1 months ago
2009
Springer
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
166
click to vote
ATVA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
178
click to vote
DATAMINE
2006
15 years 6 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
175
click to vote
TIP
1998
15 years 6 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...