3096 search results - page 32 / 620 » The Generalized FITC Approximation |
JACM
1998
14 years 11 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
105
click to vote
TIP
1998
14 years 11 months ago
1998
Abstract—A general variational framework for image approximation and segmentation is introduced. By using a continuous “line-process” to represent edge boundaries, it is poss...
107
click to vote
SIAMCOMP
2000
14 years 11 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
195
click to vote
DAC
2011
ACM
13 years 11 months ago
2011
ACM
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
113
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...