7129 search results - page 699 / 1426 » Approximation Algorithms for Treewidth |
201
click to vote
VMV
2007
15 years 8 months ago
2007
Whenever approximate 3D geometry is projectively texture-mapped from different directions simultaneously, annoyingly visible aliasing artifacts are the result. To prevent such gho...
222
click to vote
ICA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
208
click to vote
GD
2008
Springer
15 years 8 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
255
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
166
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...