Sciweavers

2570 search results - page 298 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
115
Voted
NIPS
2003
15 years 5 months ago
Applying Metric-Trees to Belief-Point POMDPs
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
146
Voted
CGF
2006
177views more  CGF 2006»
15 years 3 months ago
Direct (Re)Meshing for Efficient Surface Processing
We propose a novel surface remeshing algorithm. While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to...
John M. Schreiner, Carlos Eduardo Scheidegger, Sha...
110
Voted
DAC
2009
ACM
16 years 4 months ago
A direct integral-equation solver of linear complexity for large-scale 3D capacitance and impedance extraction
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear comp...
Wenwen Chai, Dan Jiao, Cheng-Kok Koh
146
Voted
DAC
2002
ACM
16 years 4 months ago
Software synthesis from synchronous specifications using logic simulation techniques
This paper addresses the problem of automatic generation of implementation software from high-level functional specifications in the context of embedded system on chip designs. So...
Yunjian Jiang, Robert K. Brayton
210
Voted
AVSS
2009
IEEE
15 years 10 months ago
Global Illumination Compensation for Background Subtraction Using Gaussian-Based Background Difference Modeling
This paper presents a background segmentation technique, which is able to process acceptable segmentation masks under fast global illumination changes. The histogram of the frame-...
Julien A. Vijverberg, Marijn J. H. Loomans, Cornel...