Sciweavers

230 search results - page 31 / 46
» Faster algorithms for the characteristic polynomial
Sort
View
SMA
2009
ACM
134views Solid Modeling» more  SMA 2009»
15 years 11 months ago
Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
15 years 10 months ago
Simultaneity Matrix for Solving Hierarchically Decomposable Functions
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i ...
Chatchawit Aporntewan, Prabhas Chongstitvatana
IPPS
2007
IEEE
15 years 11 months ago
Constant Time Simulation of an R-Mesh on an LR-Mesh
Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among ...
Carlos Alberto Córdova-Flores, José ...
ICML
2000
IEEE
16 years 5 months ago
Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning
Algorithms for feature selection fall into two broad categories: wrappers that use the learning algorithm itself to evaluate the usefulness of features and filters that evaluate f...
Mark A. Hall
IPPS
2008
IEEE
15 years 11 months ago
On the representation and multiplication of hypersparse matrices
Multicore processors are marking the beginning of a new era of computing where massive parallelism is available and necessary. Slightly slower but easy to parallelize kernels are ...
Aydin Buluç, John R. Gilbert