4047 search results - page 148 / 810 » The Discrete Basis Problem |
115
Voted
IJON
2002
15 years 14 days ago
2002
We apply independent component analysis (ICA) for extracting an optimal basis to the problem of finding efficient features for a speaker. The basis functions learned by the algori...
123
click to vote
STACS
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
83
Voted
IV
1999
IEEE
15 years 5 months ago
1999
IEEE
In Computer Graphics, aliasing is a problem which is always present when discrete elements are mapped to continuous functions or vice-versa. Although there is no general solution ...
107
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
106
click to vote
HEURISTICS
2002
15 years 17 days ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...