Sciweavers

274 search results - page 33 / 55
» Counting lattice vectors
Sort
View
APIN
2004
107views more  APIN 2004»
15 years 1 months ago
Designing Polymer Blends Using Neural Networks, Genetic Algorithms, and Markov Chains
In this paper we present a new technique to simulate polymer blends that overcomes the shortcomings in polymer system modeling. This method has an inherent advantage in that the v...
N. K. Roy, Walter D. Potter, D. P. Landau
IJAR
2011
86views more  IJAR 2011»
14 years 5 months ago
On open questions in the geometric approach to structural learning Bayesian nets
The basic idea of an algebraic approach to learning Bayesian network (BN) structures is to represent every BN structure by a certain uniquely determined vector, called the standar...
Milan Studený, Jirí Vomlel
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
15 years 8 months ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender
97
Voted
JCT
2010
83views more  JCT 2010»
15 years 9 days ago
Families of prudent self-avoiding walks
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that ha...
Mireille Bousquet-Mélou
110
Voted
WCE
2007
15 years 3 months ago
Wavepackets in the Recognition of Isolated Handwritten Characters
— This work is to apply wavelet packet transformation for the recognition of isolated handwritten Malayalam (one of the south Indian languages) characters. The key idea is that c...
G. Raju, K. Revathy