Sciweavers

5653 search results - page 874 / 1131
» Distributed Conceptual Structures
Sort
View
PPOPP
2009
ACM
16 years 7 months ago
How much parallelism is there in irregular applications?
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
Milind Kulkarni, Martin Burtscher, Rajeshkar Inkul...
SPAA
2009
ACM
16 years 7 months ago
Inherent limitations on disjoint-access parallel implementations of transactional memory
Transactional memory (TM) is a promising approach for designing concurrent data structures, and it is essential to develop better understanding of the formal properties that can b...
Hagit Attiya, Eshcar Hillel, Alessia Milani
HPCA
2009
IEEE
16 years 7 months ago
Criticality-based optimizations for efficient load processing
Some instructions have more impact on processor performance than others. Identification of these critical instructions can be used to modify and improve instruction processing. Pr...
Samantika Subramaniam, Anne Bracy, Hong Wang 0003,...
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
16 years 7 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
CHI
2006
ACM
16 years 7 months ago
GUESS: a language and interface for graph exploration
As graph models are applied to more widely varying fields, researchers struggle with tools for exploring and analyzing these structures. We describe GUESS, a novel system for grap...
Eytan Adar