Sciweavers

5414 search results - page 1032 / 1083
» Data representation synthesis
Sort
View
BMCBI
2005
104views more  BMCBI 2005»
13 years 9 months ago
Scoring functions for transcription factor binding site prediction
Background: Transcription factor binding site (TFBS) prediction is a difficult problem, which requires a good scoring function to discriminate between real binding sites and backg...
Markus T. Friberg, Peter von Rohr, Gaston H. Gonne...
BMCBI
2004
208views more  BMCBI 2004»
13 years 9 months ago
Using 3D Hidden Markov Models that explicitly represent spatial coordinates to model and compare protein structures
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
Vadim Alexandrov, Mark Gerstein
CGF
2002
184views more  CGF 2002»
13 years 9 months ago
The 3D Model Acquisition Pipeline
Three-dimensional (3D) image acquisition systems are rapidly becoming more affordable, especially systems based on commodity electronic cameras. At the same time, personal compute...
Fausto Bernardini, Holly E. Rushmeier
DATAMINE
2002
147views more  DATAMINE 2002»
13 years 9 months ago
Discretization: An Enabling Technique
Discrete values have important roles in data mining and knowledge discovery. They are about intervals of numbers which are more concise to represent and specify, easier to use and ...
Huan Liu, Farhad Hussain, Chew Lim Tan, Manoranjan...
DATAMINE
1999
152views more  DATAMINE 1999»
13 years 9 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
« Prev « First page 1032 / 1083 Last » Next »