Sciweavers

4886 search results - page 703 / 978
» Approximate Data Exchange
Sort
View
ALENEX
2007
130views Algorithms» more  ALENEX 2007»
15 years 8 months ago
Locating Guards for Visibility Coverage of Polygons
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
Yoav Amit, Joseph S. B. Mitchell, Eli Packer
LREC
2010
188views Education» more  LREC 2010»
15 years 8 months ago
How Large a Corpus Do We Need: Statistical Method Versus Rule-based Method
We investigate the impact of input data scale in corpus-based learning using a study style of Zipf's law. In our research, Chinese word segmentation is chosen as the study ca...
Hai Zhao, Yan Song, Chunyu Kit
DAGSTUHL
2008
15 years 8 months ago
Transfinite Interpolation for Well-Definition in Error Analysis in Solid Modelling
An overall approach to the problem of error analysis in the context of solid modelling, analogous to the standard forward/backward error analysis of Numerical Analysis, was describ...
Neil F. Stewart, Malika Zidani
170
Voted
EMNLP
2008
15 years 8 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
ICMLA
2008
15 years 8 months ago
A Bayesian Approach to Switching Linear Gaussian State-Space Models for Unsupervised Time-Series Segmentation
Time-series segmentation in the fully unsupervised scenario in which the number of segment-types is a priori unknown is a fundamental problem in many applications. We propose a Ba...
Silvia Chiappa