Sciweavers

373 search results - page 21 / 75
» On the Complexity of Finding Emerging Patterns
Sort
View
BMCBI
2010
183views more  BMCBI 2010»
13 years 4 months ago
The complexity of gene expression dynamics revealed by permutation entropy
Background: High complexity is considered a hallmark of living systems. Here we investigate the complexity of temporal gene expression patterns using the concept of Permutation En...
Xiaoliang Sun, Yong Zou, Victoria J. Nikiforova, J...
IJAR
2006
92views more  IJAR 2006»
13 years 7 months ago
Possibilistic clustering approach to trackless ring Pattern Recognition in RICH counters
The pattern recognition problem in Ring Imaging CHerenkov (RICH) counters concerns the identification of an unknown number of rings whose centers and radii are assumed to be unkno...
A. M. Massone, Léonard Studer, Francesco Ma...
CLUSTER
2004
IEEE
13 years 11 months ago
Predicting memory-access cost based on data-access patterns
Improving memory performance at software level is more effective in reducing the rapidly expanding gap between processor and memory performance. Loop transformations (e.g. loop un...
Surendra Byna, Xian-He Sun, William Gropp, Rajeev ...
BVAI
2005
Springer
14 years 27 days ago
Algorithm That Mimics Human Perceptual Grouping of Dot Patterns
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
Giuseppe Papari, Nicolai Petkov
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
12 years 11 months ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...