Sciweavers

34 search results - page 6 / 7
» A Method for Approximation to Ontology Reuse Problem
Sort
View
KCAP
2005
ACM
15 years 3 months ago
Indirect anaphora resolution as semantic path search
Anaphora occur commonly in natural language text, and resolving them is essential for capturing the knowledge encoded in text. Indirect anaphora are especially challenging to reso...
James Fan, Ken Barker, Bruce W. Porter
RAS
2007
102views more  RAS 2007»
14 years 9 months ago
Fast and accurate SLAM with Rao-Blackwellized particle filters
Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter in which each ...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
14 years 9 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
ICRA
2006
IEEE
110views Robotics» more  ICRA 2006»
15 years 3 months ago
Speeding-up Rao-blackwellized SLAM
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
CVPR
2009
IEEE
1468views Computer Vision» more  CVPR 2009»
16 years 5 months ago
Hardware-Efficient Belief Propagation
Belief propagation (BP) is an effective algorithm for solving energy minimization problems in computer vision. However, it requires enormous memory, bandwidth, and computation beca...
Chao-Chung Cheng, Chia-Kai Liang, Homer H. Chen, L...