Sciweavers

12194 search results - page 95 / 2439
» Numberings Optimal for Learning
Sort
View
JCO
2007
123views more  JCO 2007»
15 years 4 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
ICPP
2008
IEEE
15 years 10 months ago
On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
David A. Bader, Aparna Chandramowlishwaran, Virat ...
IPPS
2007
IEEE
15 years 10 months ago
Tera-scalable Fourier Spectral Element Code for DNS of Channel Turbulent Flow at High Reynolds Number
Due to the extensive requirement of memory and speed for direct numerical simulation (DNS) of channel turbulence, people can only perform DNS at moderate Reynolds number before. W...
Jin Xu
CIAC
2010
Springer
252views Algorithms» more  CIAC 2010»
15 years 9 months ago
On the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
FPGA
2000
ACM
128views FPGA» more  FPGA 2000»
15 years 7 months ago
Factoring large numbers with programmable hardware
The fastest known algorithms for factoring large numbers share a core sieving technique. The sieving cores find numbers that are completely factored over a prime base set raised t...
Hea Joung Kim, William H. Mangione-Smith