Sciweavers

740 search results - page 128 / 148
» An approximation ratio for biclustering
Sort
View
CCCG
2007
15 years 1 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
COLING
2008
15 years 1 months ago
OntoNotes: Corpus Cleanup of Mistaken Agreement Using Word Sense Disambiguation
Annotated corpora are only useful if their annotations are consistent. Most large-scale annotation efforts take special measures to reconcile inter-annotator disagreement. To date...
Liang-Chih Yu, Chung-Hsien Wu, Eduard H. Hovy
DMIN
2007
76views Data Mining» more  DMIN 2007»
15 years 1 months ago
Towards Average Case Analysis of Itemset Mining
—We perform a statistical analysis and describe the asymptotic behavior of the frequency and size distribution of δoccurrent, minimal δ-occurrent, and maximal δ-occurrent item...
Dan Singer, David J. Haglin, Anna M. Manning
LREC
2008
93views Education» more  LREC 2008»
15 years 1 months ago
Manual vs Assisted Transcription of Prepared and Spontaneous Speech
Our paper focuses on the gain which can be achieved on human transcription of spontaneous and prepared speech, by using the assistance of an ASR system. This experiment has shown ...
Thierry Bazillon, Yannick Estève, Daniel Lu...
SIROCCO
2001
15 years 1 months ago
Competitive Online Routing in Geometric Graphs
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
Prosenjit Bose, Pat Morin