5595 search results - page 723 / 1119 » Approximation Algorithms for Clustering Problems |
159
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 ...
180
Voted
MLDM
2008
Springer
15 years 6 months ago
2008
Springer
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
200
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
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 diffe...
172
click to vote
ISCAS
1999
IEEE
15 years 11 months ago
1999
IEEE
In this letter, a new class of nonlinear filters called vector median-rational hybrid filters (VMRHF's) for multispectral image processing is introduced and applied to the col...
188
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...