Sciweavers

1539 search results - page 74 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
JAIR
2006
160views more  JAIR 2006»
15 years 2 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
FPGA
2003
ACM
116views FPGA» more  FPGA 2003»
15 years 7 months ago
Hardware-assisted simulated annealing with application for fast FPGA placement
To truly exploit FPGAs for rapid turn-around development and prototyping, placement times must be reduced to seconds; latebound, reconfigurable computing applications may demand p...
Michael G. Wrighton, André DeHon
ASPDAC
2005
ACM
131views Hardware» more  ASPDAC 2005»
15 years 4 months ago
Analysis of buffered hybrid structured clock networks
- This paper presents a novel approach for fast transient analysis of buffered hybrid structured clock networks. The new method applies structure reduction and relaxed hierarchical...
Yi Zou, Qiang Zhou, Yici Cai, Xianlong Hong, Sheld...
113
Voted
PVLDB
2010
174views more  PVLDB 2010»
15 years 27 days ago
x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases
The RDF data model is gaining importance for applications in computational biology, knowledge sharing, and social communities. Recent work on RDF engines has focused on scalable p...
Thomas Neumann, Gerhard Weikum
PSIVT
2009
Springer
130views Multimedia» more  PSIVT 2009»
15 years 9 months ago
Compact Fundamental Matrix Computation
Abstract. A very compact algorithm is presented for fundamental matrix computation from point correspondences over two images. The computation is based on the strict maximum likeli...
Kenichi Kanatani, Yasuyuki Sugaya