Sciweavers

1150 search results - page 184 / 230
» Algorithmic transforms for efficient energy scalable computa...
Sort
View
SAC
2009
ACM
15 years 11 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
ICSOC
2003
Springer
15 years 9 months ago
Service Oriented Internet
Effective service delivery capabilities are critical to the transformation of the Internet into a viable commercial infrastructure. At the present time, the architecture of the Int...
Jaideep Chandrashekar, Zhi-Li Zhang, Zhenhai Duan,...
AAAI
2010
15 years 5 months ago
Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners
Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently,...
Miquel Ramírez, Hector Geffner
DAC
2003
ACM
16 years 5 months ago
An algebraic multigrid solver for analytical placement with layout based clustering
An efficient matrix solver is critical to the analytical placement. As the size of the matrix becomes huge, the multilevel methods turn out to be more efficient and more scalable....
Hongyu Chen, Chung-Kuan Cheng, Nan-Chi Chou, Andre...
EDBT
2008
ACM
160views Database» more  EDBT 2008»
15 years 6 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu