Sciweavers

366 search results - page 49 / 74
» Towards a Complexity Model for Design and Analysis of PGAS-B...
Sort
View
ICWSM
2009
13 years 5 months ago
Compositionality Principle in Recognition of Fine-Grained Emotions from Text
The recognition of personal emotional state or sentiment conveyed through text is the main task we address in our research. The communication of emotions through text messaging an...
Alena Neviarouskaya, Helmut Prendinger, Mitsuru Is...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 8 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
SC
2009
ACM
14 years 8 days ago
Plasma fusion code coupling using scalable I/O services and scientific workflows
In order to understand the complex physics of mother nature, physicist often use many approximations to understand one area of physics and then write a simulation to reduce these ...
Norbert Podhorszki, Scott Klasky, Qing Liu, Cipria...
PODC
2009
ACM
14 years 8 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 8 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano