Sciweavers

3360 search results - page 398 / 672
» Opportunistic Data Structures with Applications
Sort
View
ICFP
2010
ACM
15 years 7 months ago
Bidirectionalizing graph transformations
Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results o...
Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hir...
ICML
2004
IEEE
16 years 7 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
SAC
2009
ACM
16 years 1 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
ER
2007
Springer
97views Database» more  ER 2007»
16 years 13 days ago
Towards Active Conceptual Modelling for Sudden Events
There are a number of issues for information systems which are required to collect data urgently that are not well accommodated by current conceptual modelling methodologies and a...
John F. Roddick, Aaron Ceglar, Denise de Vries
MST
2006
136views more  MST 2006»
15 years 6 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl