3208 search results - page 109 / 642 » A Lower Bound for Primality |
172
click to vote
RSFDGRC
2009
Springer
16 years 28 days ago
2009
Springer
A new clustering strategy is proposed based on interval sets, which is an alternative formulation different from the ones used in the existing studies. Instead of using a single s...
217
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
168
click to vote
FCT
2005
Springer
15 years 12 months ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
172
click to vote
COMPGEOM
2009
ACM
15 years 11 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....
128
click to vote
APPML
2007
15 years 6 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...