Sciweavers

105 search results - page 21 / 21
» Hyperplane Partitioning: An Approach to Global Data Partitio...
Sort
View
EUROPAR
2010
Springer
13 years 3 months ago
A Language-Based Tuning Mechanism for Task and Pipeline Parallelism
Abstract. Current multicore computers differ in many hardware aspects. Tuning parallel applications is indispensable to achieve best performance on a particular hardware platform....
Frank Otto, Christoph A. Schaefer, Matthias Dempe,...
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 12 days ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
SIGARCH
2008
73views more  SIGARCH 2008»
13 years 4 months ago
Servo: a programming model for many-core computing
Conventional programming models were designed to be used by expert programmers for programming for largescale multiprocessors, distributed computational clusters, or specialized p...
Nicolas Zea, John Sartori, Rakesh Kumar
ISCOPE
1998
Springer
13 years 9 months ago
The Mobile Object Layer: A Run-Time Substrate for Mobile Adaptive Computations
In this paper we present a parallel runtime substrate that supports a global addressing scheme, object mobility, and automatic message forwarding required for the implementation o...
Nikos Chrisochoides, Kevin Barker, Démian N...
VLDB
2004
ACM
187views Database» more  VLDB 2004»
13 years 10 months ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi