Sciweavers

166 search results - page 33 / 34
» Tighter Bounds for Structured Estimation
Sort
View
SI3D
2003
ACM
13 years 9 months ago
Perceptually guided simplification of lit, textured meshes
We present a new algorithm for best-effort simplification of polygonal meshes based on principles of visual perception. Building on previous work, we use a simple model of low-lev...
Nathaniel Williams, David P. Luebke, Jonathan D. C...
ESSMAC
2003
Springer
13 years 9 months ago
Joint Optimization of Wireless Communication and Networked Control Systems
Abstract. We consider a linear system, such as an estimator or a controller, in which several signals are transmitted over wireless communication channels. With the coding and medi...
Lin Xiao, Mikael Johansson, Haitham A. Hindi, Step...
AIPS
2009
13 years 5 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
IPM
2006
157views more  IPM 2006»
13 years 4 months ago
Collaborative bibliography
A bibliography is traditionally characterized by the judgments, bounded by explicit selection criteria, made by a single compiler. Because these criteria concern the attributes as...
David G. Hendry, J. R. Jenkins, Joseph F. McCarthy
JCB
2006
115views more  JCB 2006»
13 years 4 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger