Sciweavers

208 search results - page 13 / 42
» A New Direction in AI - Toward a Computational Theory of Per...
Sort
View
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
13 years 9 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
ISVC
2009
Springer
14 years 2 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House
ACL
2009
13 years 5 months ago
A Syntax-Driven Bracketing Model for Phrase-Based Translation
Syntactic analysis influences the way in which the source sentence is translated. Previous efforts add syntactic constraints to phrase-based translation by directly rewarding/puni...
Deyi Xiong, Min Zhang, AiTi Aw, Haizhou Li
CORR
1998
Springer
85views Education» more  CORR 1998»
13 years 7 months ago
The Proper Treatment of Optimality in Computational Phonology
Abstract. This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison 1994, the n...
Lauri Karttunen
IEEESCC
2009
IEEE
13 years 5 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...