Sciweavers

735 search results - page 47 / 147
» Randomization in Parallel Stringology
Sort
View
PODS
2005
ACM
164views Database» more  PODS 2005»
16 years 2 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
135
Voted
CPHYSICS
2006
204views more  CPHYSICS 2006»
15 years 2 months ago
Genetically controlled random search: a global optimization method for continuous multidimensional functions
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
Ioannis G. Tsoulos, Isaac E. Lagaris
110
Voted
PDP
2009
IEEE
15 years 9 months ago
Effects of Job and Task Placement on Parallel Scientific Applications Performance
—this paper studies the influence that task placement may have on the performance of applications, mainly due to the relationship between communication locality and overhead. Thi...
Javier Navaridas, Jose Antonio Pascual, José...
111
Voted
ICPP
2006
IEEE
15 years 8 months ago
Parallel Information Extraction on Shared Memory Multi-processor System
Text Mining is one of the best solutions for today and the future’s information explosion. With the development of modern processor technologies, it will be a mass market deskto...
Jiulong Shan, Yurong Chen, Qian Diao, Yimin Zhang
SPAA
2005
ACM
15 years 8 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams