Sciweavers

1217 search results - page 176 / 244
» On compressing frequent patterns
Sort
View
CCP
2011
92views more  CCP 2011»
14 years 3 months ago
Backwards Search in Context Bound Text Transformations
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
Matthias Petri, Gonzalo Navarro, J. Shane Culpeppe...
CHI
2009
ACM
16 years 4 months ago
Tactile motion instructions for physical activities
While learning new motor skills, we often rely on feedback from a trainer. Auditive feedback and demonstrations are used most frequently, but in many domains they are inappropriat...
Daniel Spelmezan, Mareike Jacobs, Anke Hilgers, Ja...
KDD
2006
ACM
127views Data Mining» more  KDD 2006»
16 years 4 months ago
Recommendation method for extending subscription periods
Online stores providing subscription services need to extend user subscription periods as long as possible to increase their profits. Conventional recommendation methods recommend...
Tomoharu Iwata, Kazumi Saito, Takeshi Yamada
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
16 years 4 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
COMPLIFE
2006
Springer
15 years 7 months ago
Beating the Noise: New Statistical Methods for Detecting Signals in MALDI-TOF Spectra Below Noise Level
Background: The computer-assisted detection of small molecules by mass spectrometry in biological samples provides a snapshot of thousands of peptides, protein fragments and prote...
Tim O. F. Conrad, Alexander Leichtle, Andre Hageh&...