Sciweavers

2192 search results - page 400 / 439
» Algorithms for Challenging Motif Problems
Sort
View
ICDM
2007
IEEE
166views Data Mining» more  ICDM 2007»
14 years 2 months ago
Mining Statistical Information of Frequent Fault-Tolerant Patterns in Transactional Databases
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
Ardian Kristanto Poernomo, Vivekanand Gopalkrishna...
CIE
2007
Springer
14 years 2 months ago
Strict Self-assembly of Discrete Sierpinski Triangles
Winfree (1998) showed that discrete Sierpinski triangles can self-assemble in the Tile Assembly Model. A striking molecular realization of this self-assembly, using DNA tiles a fe...
James I. Lathrop, Jack H. Lutz, Scott M. Summers
TACAS
2007
Springer
99views Algorithms» more  TACAS 2007»
14 years 2 months ago
"Don't Care" Modeling: A Logical Framework for Developing Predictive System Models
Analysis of biological data often requires an understanding of components of pathways and/or networks and their mutual dependency relationships. Such systems are often analyzed and...
Hillel Kugler, Amir Pnueli, Michael J. Stern, E. J...
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
14 years 2 months ago
Virtually Pipelined Network Memory
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
Banit Agrawal, Timothy Sherwood
ACCV
2006
Springer
14 years 2 months ago
A Multiscale Co-linearity Statistic Based Approach to Robust Background Modeling
Background subtraction is an essential task in several static camera based computer vision systems. Background modeling is often challenged by spatio-temporal changes occurring due...
Prithwijit Guha, Dibyendu Palai, K. S. Venkatesh, ...