Sciweavers

3708 search results - page 426 / 742
» Approximating Betweenness Centrality
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
DPHOTO
2010
195views Hardware» more  DPHOTO 2010»
15 years 8 months ago
Direct PSF estimation using a random noise target
Conventional point spread function (PSF) measurement methods often use parametric models for the estimation of the PSF. This limits the shape of the PSF to a specific form provide...
Johannes Brauers, Claude Seiler, Til Aach
DAGSTUHL
2007
15 years 8 months ago
The Unique Games Conjecture with Entangled Provers is False
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
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
LREC
2010
156views Education» more  LREC 2010»
15 years 8 months ago
A General Method for Creating a Bilingual Transliteration Dictionary
Transliteration is the rendering in one language of terms from another language (and, possibly, another writing system), approximating spelling and/or phonetic equivalents between...
Amit Kirschenbaum, Shuly Wintner