Sciweavers

1022 search results - page 91 / 205
» New models and algorithms for programmable networks
Sort
View
CORR
2012
Springer
209views Education» more  CORR 2012»
13 years 8 months ago
Densest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii
138
Voted
PPOPP
2009
ACM
16 years 1 months ago
OpenMP to GPGPU: a compiler framework for automatic translation and optimization
GPGPUs have recently emerged as powerful vehicles for generalpurpose high-performance computing. Although a new Compute Unified Device Architecture (CUDA) programming model from N...
Seyong Lee, Seung-Jai Min, Rudolf Eigenmann
OOPSLA
2007
Springer
15 years 6 months ago
The design and implementation of formal monitoring techniques
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
Eric Bodden
104
Voted
AAAI
2007
15 years 3 months ago
A Connectionist Cognitive Model for Temporal Synchronisation and Learning
The importance of the efforts towards integrating the symbolic and connectionist paradigms of artificial intelligence has been widely recognised. Integration may lead to more e...
Luís C. Lamb, Rafael V. Borges, Artur S. d'...
111
Voted
RECSYS
2010
ACM
15 years 27 days ago
Affiliation recommendation using auxiliary networks
Social network analysis has attracted increasing attention in recent years. In many social networks, besides friendship links amongst users, the phenomenon of users associating th...
Vishvas Vasuki, Nagarajan Natarajan, Zhengdong Lu,...