Sciweavers

70 search results - page 9 / 14
» Near-Bayesian exploration in polynomial time
Sort
View
JCB
2006
115views more  JCB 2006»
13 years 7 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
COCO
2001
Springer
108views Algorithms» more  COCO 2001»
13 years 12 months ago
Bounded Query Functions with Limited Output Bits
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
Richard Chang, Jon S. Squire
ICC
2007
IEEE
14 years 1 months ago
Computing Maximum-Likelihood Bounds for Reed-Solomon Codes over Partial Response Channels
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
Richard M. Todd, J. R. Cruz
CIA
2007
Springer
14 years 1 months ago
Who Works Together in Agent Coalition Formation?
Coalitions are often required for multi-agent collaboration. In this research, we consider tasks that can only be completed with the combined efforts of multiple agents using appro...
Vicki H. Allan, Kevin Westwood
TCSV
2008
155views more  TCSV 2008»
13 years 7 months ago
Heterogeneous Fusion of Omnidirectional and PTZ Cameras for Multiple Object Tracking
Dual-camera systems have been widely used in surveillance because of the ability to explore the wide field of view (FOV) of the omnidirectional camera and the wide zoom range of th...
Chung-Hao Chen, Yi Yao, David Page, Besma R. Abidi...