Sciweavers

16568 search results - page 3313 / 3314
» Structured Data on the Web
Sort
View
PPOPP
2012
ACM
12 years 3 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
PLDI
2012
ACM
11 years 10 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
TVCG
2012
213views Hardware» more  TVCG 2012»
11 years 10 months ago
Mesh-Driven Vector Field Clustering and Visualization: An Image-Based Approach
—Vector field visualization techniques have evolved very rapidly over the last two decades, however, visualizing vector fields on complex boundary surfaces from computational ...
Zhenmin Peng, Edward Grundy, Robert S. Laramee, Gu...
EDBT
2012
ACM
299views Database» more  EDBT 2012»
11 years 10 months ago
RecStore: an extensible and adaptive framework for online recommender queries inside the database engine
Most recommendation methods (e.g., collaborative filtering) consist of (1) a computationally intense offline phase that computes a recommender model based on users’ opinions o...
Justin J. Levandoski, Mohamed Sarwat, Mohamed F. M...
ICALP
2009
Springer
14 years 7 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
« Prev « First page 3313 / 3314 Last » Next »