Sciweavers

1403 search results - page 179 / 281
» Set cover algorithms for very large datasets
Sort
View
176
Voted
BMCBI
2010
146views more  BMCBI 2010»
15 years 6 months ago
A pairwise residue contact area-based mean force potential for discrimination of native protein structure
Background: Considering energy function to detect a correct protein fold from incorrect ones is very important for protein structure prediction and protein folding. Knowledge-base...
Shahriar Arab, Mehdi Sadeghi, Changiz Eslahchi, Ha...
BMCBI
2005
108views more  BMCBI 2005»
15 years 6 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
153
Voted
VMCAI
2005
Springer
15 years 11 months ago
Minimizing Counterexample with Unit Core Extraction and Incremental SAT
Abstract. It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample min...
ShengYu Shen, Ying Qin, Sikun Li
164
Voted
ESA
2010
Springer
183views Algorithms» more  ESA 2010»
15 years 7 months ago
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
Sorelle A. Friedler, David M. Mount
171
Voted
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
16 years 5 days ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...