Sciweavers

7053 search results - page 1309 / 1411
» Data Mining
Sort
View
WWW
2010
ACM
15 years 11 months ago
Sampling community structure
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Arun S. Maiya, Tanya Y. Berger-Wolf
ISPASS
2009
IEEE
15 years 11 months ago
Lonestar: A suite of parallel irregular programs
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...
CCS
2009
ACM
15 years 11 months ago
Finding "hidden" connections on linkedIn an argument for more pragmatic social network privacy
Social networking services well know that some users are unwilling to freely share the information they store with the service (e.g. profile information). To address this, servic...
Jessica Staddon
KBSE
2009
IEEE
15 years 11 months ago
Code Completion from Abbreviated Input
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
Sangmok Han, David R. Wallace, Robert C. Miller
ADMI
2009
Springer
15 years 11 months ago
Concept Learning for Achieving Personalized Ontologies: An Active Learning Approach
In many multiagent approaches, it is usual to assume the existence of a common ontology among agents. However, in dynamic systems, the existence of such an ontology is unrealistic ...
Murat Sensoy, Pinar Yolum
« Prev « First page 1309 / 1411 Last » Next »