Sciweavers

1034 search results - page 108 / 207
» Wide Classes
Sort
View
HPCC
2007
Springer
14 years 21 days ago
Concurrent Number Cruncher: An Efficient Sparse Linear Solver on the GPU
A wide class of geometry processing and PDE resolution methods needs to solve a linear system, where the non-zero pattern of the matrix is dictated by the connectivity matrix of th...
Luc Buatois, Guillaume Caumon, Bruno Lévy
ISCA
1991
IEEE
162views Hardware» more  ISCA 1991»
14 years 11 days ago
Comparison of Hardware and Software Cache Coherence Schemes
We use mean value analysis models to compare representative hardware and software cache coherence schemes for a large-scale shared-memory system. Our goal is to identify the workl...
Sarita V. Adve, Vikram S. Adve, Mark D. Hill, Mary...
CONCUR
2008
Springer
13 years 10 months ago
Unfolding-Based Diagnosis of Systems with an Evolving Topology
Abstract. We propose a framework for model-based diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, model-bas...
Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara...
NIPS
2004
13 years 10 months ago
Variational Minimax Estimation of Discrete Distributions under KL Loss
We develop a family of upper and lower bounds on the worst-case expected KL loss for estimating a discrete distribution on a finite number m of points, given N i.i.d. samples. Our...
Liam Paninski
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 10 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler