Sciweavers

32545 search results - page 720 / 6509
» Data Structures and Algorithms
Sort
View
VALUETOOLS
2006
ACM
164views Hardware» more  VALUETOOLS 2006»
16 years 1 months ago
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...
Kai Lampka, Markus Siegle
SAC
2009
ACM
16 years 2 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
IPPS
2000
IEEE
16 years 4 hour ago
Template Based Structured Collections
Collective operations on distributed data sets foster a high-level data-parallel programming style that eases many aspects of parallel programming significantly. In this paper we...
Jörg Nolte, Mitsuhisa Sato, Yutaka Ishikawa
EEE
2004
IEEE
15 years 11 months ago
Structure-Based Analysis of Web Sites
The performance of information retrieval on the Web is heavily influenced by the organization of Web pages, user navigation patterns, and guidance-related functions. Having observ...
Benjamin Yen
IJCNN
2008
IEEE
16 years 2 months ago
Comparative study on normalization procedures for cluster analysis of gene expression datasets
—Normalization before clustering is often needed for proximity indices, such as Euclidian distance, which are sensitive to differences in the magnitude or scales of the attribute...
Marcílio Carlos Pereira de Souto, Daniel S....