1469 search results - page 57 / 294 » Approximate polynomial decomposition |
UAI
2008
14 years 11 months ago
2008
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
SODA
2012
ACM
13 years 7 days ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
112
click to vote
JMM2
2008
14 years 9 months ago
2008
This paper presents a technique for face recognition which uses wavelet transform to derive desirable facial features. Three level decompositions are used to form the pyramidal mul...
108
click to vote
TCS
2011
14 years 4 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
FCT
2003
Springer
15 years 3 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...