Sciweavers

36781 search results - page 150 / 7357
» Parameterizing by the Number of Numbers
Sort
View
CLASSIFICATION
2010
13 years 8 months ago
Intelligent Choice of the Number of Clusters in K-Means Clustering: An Experimental Study with Different Cluster Spreads
: The issue of determining "the right number of clusters" in K-Means has attracted considerable interest, especially in the recent years. Cluster intermix appears to be a...
Mark Ming-Tso Chiang, Boris Mirkin
COMGEO
2011
ACM
13 years 5 months ago
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...
CORR
2011
Springer
146views Education» more  CORR 2011»
13 years 5 months ago
Refined bounds on the number of connected components of sign conditions on a variety
Let R be a real closed field, P, Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk b...
Sal Barone, Saugata Basu
MP
2011
13 years 5 months ago
Smoothed analysis of condition numbers and complexity implications for linear programming
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
John Dunagan, Daniel A. Spielman, Shang-Hua Teng
CHES
2011
Springer
276views Cryptology» more  CHES 2011»
12 years 10 months ago
FPGA-Based True Random Number Generation Using Circuit Metastability with Adaptive Feedback Control
Abstract. The paper presents a novel and efficient method to generate true random numbers on FPGAs by inducing metastability in bi-stable circuit elements, e.g. flip-flops. Meta...
Mehrdad Majzoobi, Farinaz Koushanfar, Srinivas Dev...