Sciweavers

2485 search results - page 278 / 497
» Time Bounded Frequency Computations
Sort
View
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 8 months ago
Approximability and parameterized complexity of minmax values
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen,...
ECCV
2008
Springer
14 years 10 months ago
Image Segmentation by Branch-and-Mincut
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
Victor S. Lempitsky, Andrew Blake, Carsten Rother
DSN
2009
IEEE
14 years 3 months ago
MAP-AMVA: Approximate mean value analysis of bursty systems
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
Giuliano Casale, Evgenia Smirni
ICASSP
2008
IEEE
14 years 2 months ago
Admissible stopping in viterbi beam search for unit selection in concatenative speech synthesis
Corpus-based concatenative speech synthesis is very popular these days due to its highly natural speech quality. The amount of computation required in the run time, however, is of...
Shinichi Sakai, Tatsuya Kawahara, Shun Nakamura
DCOSS
2008
Springer
13 years 10 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis