Sciweavers

4850 search results - page 397 / 970
» Approximate Data Structures with Applications
Sort
View
ATAL
2008
Springer
15 years 8 months ago
The permutable POMDP: fast solutions to POMDPs for preference elicitation
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
Finale Doshi, Nicholas Roy
MVA
2007
210views Computer Vision» more  MVA 2007»
15 years 8 months ago
Represent Image Contents Using Curves and Chain Code
This paper presents a new approach to extracting and representing structural features of images. The approach is based on both a region-based analysis and a contour-based analysis...
Pornchai Mongkolnam, Chakarida Nukoolkit, Thanee D...
JCNS
2010
90views more  JCNS 2010»
15 years 1 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
ICS
2003
Tsinghua U.
16 years 1 days ago
miNI: reducing network interface memory requirements with dynamic handle lookup
Recent work in low-latency, high-bandwidth communication systems has resulted in building user–level Network InControllers (NICs) and communication abstractions that support dir...
Reza Azimi, Angelos Bilas
HIPC
2004
Springer
16 years 7 days ago
Lock-Free Parallel Algorithms: An Experimental Study
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
Guojing Cong, David A. Bader