Sciweavers

13026 search results - page 2491 / 2606
» Probabilistic Relational Models
Sort
View
PPOPP
2009
ACM
16 years 4 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
HPCA
2009
IEEE
16 years 4 months ago
Versatile prediction and fast estimation of Architectural Vulnerability Factor from processor performance metrics
The shrinking processor feature size, lower threshold voltage and increasing clock frequency make modern processors highly vulnerable to transient faults. Architectural Vulnerabil...
Lide Duan, Bin Li, Lu Peng
169
Voted
KDD
2009
ACM
230views Data Mining» more  KDD 2009»
16 years 4 months ago
Analyzing patterns of user content generation in online social networks
Various online social networks (OSNs) have been developed rapidly on the Internet. Researchers have analyzed different properties of such OSNs, mainly focusing on the formation an...
Lei Guo, Enhua Tan, Songqing Chen, Xiaodong Zhang,...
135
Voted
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
16 years 4 months ago
A multi-relational approach to spatial classification
Spatial classification is the task of learning models to predict class labels based on the features of entities as well as the spatial relationships to other entities and their fe...
Richard Frank, Martin Ester, Arno Knobbe
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
16 years 3 months ago
Effective label acquisition for collective classification
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
Mustafa Bilgic, Lise Getoor
« Prev « First page 2491 / 2606 Last » Next »