3415 search results - page 112 / 683 » Lower Bounds for Kernelizations |
132
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
102
click to vote
APPML
2007
15 years 4 months ago
2007
In this note, we obtain a lower bound for the distance between the pseudospectrum of a matrix polynomial and a given point that lies out of it, generalizing a known result on pseu...
131
Voted
JCSS
1998
15 years 3 months ago
1998
This paper gives nearly optimal, logarithmic upper and lower bounds on the minimum degree of Nullstellensatz refutations (i.e., polynomials) of the propositional induction princip...
108
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
The problem of signature verification is considered within the bounds of the kernel-based methodology of pattern recognition, more specifically, SVM principle of machine learning....
125
Voted
ECCC
2002
15 years 4 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...