Sciweavers

1625 search results - page 239 / 325
» Learning to Find Pre-Images
Sort
View
ICML
2003
IEEE
14 years 10 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
ICML
1996
IEEE
14 years 10 months ago
Searching for Structure in Multiple Streams of Data
Finding structure in multiple streams of data is an important problem. Consider the streams of data owing from a robot's sensors, the monitors in an intensive care unit, or p...
Tim Oates, Paul R. Cohen
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 10 months ago
Named entity mining from click-through data using weakly supervised latent dirichlet allocation
This paper addresses Named Entity Mining (NEM), in which we mine knowledge about named entities such as movies, games, and books from a huge amount of data. NEM is potentially use...
Gu Xu, Shuang-Hong Yang, Hang Li
RECOMB
2006
Springer
14 years 10 months ago
CONTRAlign: Discriminative Training for Protein Sequence Alignment
In this paper, we present CONTRAlign, an extensible and fully automatic framework for parameter learning and protein pairwise sequence alignment using pair conditional random field...
Chuong B. Do, Samuel S. Gross, Serafim Batzoglou
RECOMB
2005
Springer
14 years 10 months ago
Predicting Transcription Factor Binding Sites Using Structural Knowledge
Abstract. Current approaches for identification and detection of transcription factor binding sites rely on an extensive set of known target genes. Here we describe a novel structu...
Tommy Kaplan, Nir Friedman, Hanah Margalit