Sciweavers

1297 search results - page 6 / 260
» fews 2007
Sort
View
PAMI
2007
118views more  PAMI 2007»
14 years 11 months ago
Learning to Transform Time Series with a Few Examples
We describe a semi-supervised regression algorithm that learns to transform one time series into another time series given examples of the transformation. This algorithm is applie...
Ali Rahimi, Ben Recht, Trevor Darrell
ICDM
2007
IEEE
96views Data Mining» more  ICDM 2007»
15 years 6 months ago
The Chosen Few: On Identifying Valuable Patterns
Constrained pattern mining extracts patterns based on their individual merit. Usually this results in far more patterns than a human expert or a machine learning technique could m...
Björn Bringmann, Albrecht Zimmermann
FSTTCS
2007
Springer
15 years 5 months ago
Covering Graphs with Few Complete Bipartite Subgraphs
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
Herbert Fleischner, Egbert Mujuni, Daniël Pau...
CLEAR
2007
Springer
166views Biometrics» more  CLEAR 2007»
15 years 6 months ago
The IBM Rich Transcription 2007 Speech-to-Text Systems for Lecture Meetings
The paper describes the IBM systems submitted to the NIST Rich Transcription 2007 (RT07) evaluation campaign for the speechto-text (STT) and speaker-attributed speech-to-text (SAST...
Jing Huang, Etienne Marcheret, Karthik Visweswaria...
SEMWEB
2007
Springer
15 years 5 months ago
ASMOV Results for OAEI 2007
Numerous ontology alignment algorithms have appeared in the literature in recent years, but only a few make use of the semantics enclosed within the ontologies in order to improve ...
Yves R. Jean-Mary, Mansur R. Kabuka