Sciweavers

4377 search results - page 485 / 876
» Mass problems and randomness
Sort
View
SIAMSC
2010
141views more  SIAMSC 2010»
15 years 5 months ago
Blendenpik: Supercharging LAPACK's Least-Squares Solver
Abstract. Several innovative random-sampling and random-mixing techniques for solving problems in linear algebra have been proposed in the last decade, but they have not yet made a...
Haim Avron, Petar Maymounkov, Sivan Toledo
TALG
2010
74views more  TALG 2010»
15 years 5 months ago
Comparison-based time-space lower bounds for selection
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
Timothy M. Chan
184
Voted
ASPDAC
2010
ACM
211views Hardware» more  ASPDAC 2010»
15 years 4 months ago
A fast analog mismatch analysis by an incremental and stochastic trajectory piecewise linear macromodel
To cope with an increasing complexity when analyzing analog mismatch in sub-90nm designs, this paper presents a fast non-MonteCarlo method to calculate mismatch in time domain. Th...
Hao Yu, Xuexin Liu, Hai Wang, Sheldon X.-D. Tan
219
Voted
IMC
2010
ACM
15 years 4 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
IPPS
2010
IEEE
15 years 4 months ago
A PRAM-NUMA model of computation for addressing low-TLP workloads
It is possible to implement the parallel random access machine (PRAM) on a chip multiprocessor (CMP) efficiently with an emulated shared memory (ESM) architecture to gain easy par...
Martti Forsell