Sciweavers

7129 search results - page 953 / 1426
» Approximation Algorithms for Treewidth
Sort
View
CGF
2008
121views more  CGF 2008»
15 years 4 months ago
Tensor Clustering for Rendering Many-Light Animations
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...
Milos Hasan, Edgar Velázquez-Armendá...
JACM
2006
99views more  JACM 2006»
15 years 4 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
JALC
2007
90views more  JALC 2007»
15 years 4 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
JSAC
2007
133views more  JSAC 2007»
15 years 4 months ago
On broadcasting with cooperative diversity in multi-hop wireless networks
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
Gentian Jakllari, Srikanth V. Krishnamurthy, Micha...
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
15 years 4 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...